[Erlang Systems]

digraph_utils

MODULE

MODULE SUMMARY

DESCRIPTION

EXPORTS

components(Graph) -> [Component]

strong_components(Graph) -> [StrongComponent]

cyclic_strong_components(Graph) -> [StrongComponent]

reachable(Vertices, Graph) -> Vertices

reachable_neighbours(Vertices, Graph) -> Vertices

reaching(Vertices, Graph) -> Vertices

reaching_neighbours(Vertices, Graph) -> Vertices

topsort(Graph) -> Vertices | false

is_acyclic(Graph) -> bool()

loop_vertices(Graph) -> Vertices

subgraph(Graph, Vertices, Options) -> Subgraph | {error, Reason}
subgraph(Graph, Vertices) -> Subgraph | {error, Reason}

condensation(Graph) -> CondensedGraph

preorder(Graph) -> Vertices

postorder(Graph) -> Vertices

See Also

AUTHORS


stdlib 1.9.1
Copyright © 1991-2000 Ericsson Utvecklings AB