-
Notifications
You must be signed in to change notification settings - Fork 2
Condensation Graph
Mark Junker edited this page Jun 7, 2018
·
1 revision
This algorithm condensate any graph by merge a set of edges in a condensated edge. The user can provide a predicate of edges to specify which edge to condensate or condenstate by components as well.
The AlgorithmExtensions class provide various helpers, Condensate...
, to condenstate graphs:
IVertexAndEdgeListGraph<TVertex, TEdge> g = ...; // input graph
var condensated = g.CondenstateWeaklyConnected();