Reachable :: Graph -> Vertex -> SourceĪ list of vertices reachable from a given vertex. An undirected graph is biconnected if the deletion of any vertex leaves it connected. The strongly connected components of a graph. Two vertices are connected if there is a path between them, traversing edges in either direction. The order is partially specified by the condition that a vertex i precedes j whenever j is reachable from i but not vice versa.Ĭomponents :: Graph -> Forest Vertex Source behind SDO: the data graph, the data object, the disconnected way of working. Algorithmsĭfs :: Graph -> -> Forest Vertex SourceĪ spanning forest of the part of the graph reachable from the listed vertices, obtained from a depth-first search of the graph starting at each of the listed vertices in order.Ī spanning forest of the graph, obtained from a depth-first search of the graph starting from each vertex in an unspecified order.Ī topological sort of the graph. Graph propertiesĪ table of the count of edges from each node.Ī table of the count of edges into each node. The graph obtained by reversing all edges.
This version of graphFromEdges is for backwards compatibility.īuildG :: Bounds -> -> Graph Source Identical to graphFromEdges, except that the return value does not include the function which maps keys to vertices. GraphFromEdges' :: Ord key => )] -> ( Graph, Vertex -> (node, key, )) Source The out-list may contain keys that don't correspond to nodes of the graph they are ignored. GraphFromEdges :: Ord key => )] -> ( Graph, Vertex -> (node, key, ), key -> Maybe Vertex) Sourceīuild a graph from a list of nodes uniquely identified by keys, with a list of keys of nodes this node should have edges to. Table indexed by a contiguous set of vertices.Īn edge from the first vertex to the second.Ībstract representation of vertices. GraphsĪdjacency list representation of a graph, mapping each vertex to its list of successors. The vertices of a list of strongly connected components.
The vertices of a strongly connected component.
0 kommentar(er)
