ap package:fgl

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).

Static and Dynamic Inductive Graphs

Minimum implementation: empty, isEmpty, match, mkGraph, labNodes

Map a function over the Edge labels in a graph.

Build a graph out of the contexts for which the predicate is satisfied by recursively calling match.

Map a function over the graph by recursively calling match.

Create a Graph from the list of LNodes and LEdges. For graphs that are also instances of DynGraph, mkGraph ns es should be equivalent to (insEdges es . insNodes ns) empty.

Build a quasi-unlabeled Graph.

Map functions over both the Node and Edge labels in a graph.

Map a function over the Node labels in a graph.

Returns the subgraph induced by the supplied nodes.

Pairing heap implementation of dictionary