package core:container/topological_sort

⌘K
Ctrl+K
or
/

    Overview

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

    Index

    Types (2)
    Constants (0)

    This section is empty.

    Variables (0)

    This section is empty.

    Procedure Groups (0)

    This section is empty.

    Types

    Relations ¶

    Relations :: struct($Value: typeid) {}

    Sorter ¶

    Sorter :: struct($Value: typeid) {}
    Related Procedures With Parameters

    Constants

    This section is empty.

    Variables

    This section is empty.

    Procedures

    add_dependency ¶

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

    add_key ¶

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

    destroy ¶

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

    init ¶

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

    sort ¶

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

    Procedure Groups

    This section is empty.

    Source Files

    Generation Information

    Generated with odin version dev-2024-03 (vendor "odin") Windows_amd64 @ 2024-03-01 21:10:24.272837400 +0000 UTC