Finds the articulation points for a connected undirected graph, by using the low numbers criteria:
a) The root node is an articulation point iff it has two or more children.
b) An non-root node v is an articulation point iff there exists at least one child w of v such that lowNumber(w) >= dfsNumber(v).
> i 0
> For each edge a--->b insert into graph the edge a<---b . Then change the
> i (i,0,i)
> label of every edge from a---->b to a------->b
Static and Dynamic Inductive Graphs
Simple graphviz output.
Simple Finite Maps. This implementation provides several useful methods that Data.FiniteMap does not.
Pairing heap implementation of dictionary
Utility methods to automatically generate and keep track of a mapping between node labels and Nodes.
Map a function over the Edge labels in a graph.
Generate a mapping containing the nodes in the given graph.
Map a function over the graph.
encapsulates a simple recursion schema on graphs
Formats a graph for use in graphviz.
Format a graph for graphviz with reasonable defaults: title of "fgl", 8.5x11 pages, one page, landscape orientation
Show more results