Formerly brainrape/elm-arc-diagram. Search finds this package by either name.
The following type aliases are used to make type annotations more meaningful.
Represents a directed graph with no cycles.
From a directed graph represented as a set of edges, get an
AcyclicDigraph if the graph has no cycles; otherwise, get a list of all
its simple cycles.
From an AcyclicDigraph, get its representation as a set of edges.
Get a dictionary mapping node to topological rank. Rank numbering starts at 1 for all source nodes.
From topologically-ranked nodes, get a well-ordered list of nodes by
providing a (Node -> comparable) function to sort same-ranked nodes by.