Connectivity.cs File Reference

Go to the source code of this file.

Classes
class	Satsuma.BiEdgeConnectedComponents
	Finds the bridges and 2-edge-connected components in a graph. More...
class	Satsuma.BiNodeConnectedComponents
	Finds the cutvertices and blocks (2-node-connected components) of a graph. More...
class	Satsuma.Bipartition
	Decides whether the graph is bipartite and finds a bipartition into red and blue nodes. More...
class	Satsuma.BridgeDfs
class	Satsuma.ConnectedComponents
	Finds the connected components of a graph. More...
class	Satsuma.FindPathExtensions
	Extension methods for IGraph, for finding paths. More...
class	Satsuma.LowpointDfs
	Calculates the lowpoint for each node.
class	Satsuma.StrongComponents
	Finds the strongly connected components of a digraph. More...
class	Satsuma.TopologicalOrder
	Decides whether a digraph is acyclic and finds a topological order of its nodes. More...

Namespaces
package	Satsuma