core/container/topological_sort package | Odin Programming Language

A generic `O(V+E)` topological sorter implementation. This is the fastest known method for topological sorting. Odin's map type is being used to accelerate lookups.

Collection Info

View Source

Collection: core
Path: container/topological_sort
Entries: 7

Constants 0

Types 2

Jump to Types

Relations Sorter

Procedures 5

Jump to Procedures

add_dependency add_key destroy init sort

Procedure Groups 0

Variables 0

Source Files

topological_sort.odin

Types

Relations #

Source

Relations :: Relations

Sorter #

Source

Sorter :: Sorter

Procedures

add_dependency #

Source

add_dependency :: proc(sorter: ^$S/Sorter($K), key, dependency: $K) -> bool {…}

add_key #

Source

add_key :: proc(sorter: ^$S/Sorter($K), key: $K) -> bool {…}

destroy #

Source

destroy :: proc(sorter: ^$S/Sorter($K)) {…}

init #

Source

init :: proc(sorter: ^$S/Sorter($K)) {…}

sort #

Source

sort :: proc(sorter: ^$S/Sorter($K)) -> (sorted, cycled: $$deferred_return) {…}