Namespace AlgorithmsSW.Graph
Classes
- Connectivity
A class for querying connectivity properties of a graph.
- GraphWithAdjacentsBoolArray
Represents a graph with a fixed number of vertices and edges, where adjacency is represented by a boolean array.
- GraphWithAdjacentsIntArray
Represents a graph with a fixed number of vertices and edges, where adjacency is represented by a boolean array.
- Indexer<T>
Class that can assign indexes to symbols.
Interfaces
- IGraph
Represents a graph data structure.
- IReadOnlyGraph
Represents a graph data structure.