BitGraph.Algorithms (bitgraph v0.1.1)

Summary

Functions

acyclic?(graph)

components(graph)

get_cycle(graph, vertex)

strong_components(graph, component_handler \\ &Function.identity/1)

topsort(graph)