A clustered adjacency graph

Namespace:  QuickGraph.Representations
Assembly:  QuickGraph.Algorithms (in QuickGraph.Algorithms.dll) Version: 2.4.2.1515 (2.4.2.1515)

Syntax

Remarks

This class implements a clustered AdjacencyGraph: an AdjacencyGraph that has sub-graphs (clusters). Each cluster is a ClusteredAdjacencyGraph which can also have sub-graphs.

Suppose that G=(V,E) is the main graph and that G1=(V1,E1) is a cluster:

  • If v is added to V1, then v also belongs to V.
  • If v is added to V, then v does not belong to V1.

Threading: Not thread safe.

Inheritance Hierarchy

System..::.Object
  QuickGraph.Representations..::.ClusteredAdjacencyGraph

See Also