Project Mendz.Graphs at a Glance

This article serves as the Mendz.Graphs series ToC (Table of Contents). Consider bookmarking for a quick and easy reference.

Note that the ff. is organized by namespace.

Mendz.Library.Matrices

• IDOKSparseMatrix and DOKSparseMatrixBase defines the DOK sparse matrix as wrappers of IDictionary.
• The DOK Sparse Matrix Types defines concrete implementations of the DOK sparse matrix. This includes the CoordinatesKeyedConcurrentSparseMatrix, which is used by Mendz.Graphs.Represenations.Matrices.Sparse.

Mendz.Graphs

• Vertex represents a vertex (original).
• Edge represents an edge, which is basically a vertex pair (original).
• Graph represents a graph G = (V, E) (original).

Mendz.Graphs.Representations

• GraphRepresentationBase is the base class of graph representations.
• IGraphList and GraphListBase define a graph list representation.
• IGraphMatrix and GraphMatrixBase define a graph matrix representation.

Mendz.Graphs.Representations.Lists

• AdjacencyList represents the graph as an adjacency list.

Mendz.Graphs.Representations.Matrices

• ConnectionMatrix represents a (true, false, false)-adjacency matrix of a graph that can be used in Boolean algebra and related Boolean matrix operations.
• DenseGraphMatrixBase represents a dense graph matrix.
• SparseGraphMatrixBase represents a sparse graph matrix.

Mendz.Graphs.Representations.Matrices.Dense

• AdjacencyMatrixBase is the base class of dense adjacency matrices.
• AdjacencyMatrix represents a dense (1, 0, 0)-adjacency list.
• WeightedAdjacencyMatrix represents a dense weighted adjacency matrix.
• SeidelAdjacencyMatrix represents a dense (-1, 1, 0)-adjacency matrix.
• LaplacianMatrix represents a dense (-1, 0, d)-adjacency matrix, where d is the degree of the vertex.
• GenericAdjacencyMatrix provides a generic dense (a, b, c)-adjacency matrix implementation.
• DegreeMatrix, InDegreeMatrix and OutDegreeMatrix represent dense diagonal matrices of vertex degrees.
• IncidenceMatrix represents a dense incidence matrix.

Mendz.Graphs.Representations.Matrices.Sparse

• AdjacencyMatrixBase is the base class of sparse adjacency matrices.
• AdjacencyMatrix represents a sparse (1, 0, 0)-adjacency list.
• WeightedAdjacencyMatrix represents a sparse weighted adjacency matrix.
• SeidelAdjacencyMatrix represents a sparse (-1, 1, 0)-adjacency matrix.
• LaplacianMatrix represents a sparse (-1, 0, d)-adjacency matrix, where d is the degree of the vertex.
• GenericAdjacencyMatrix provides a generic sparse (a, b, c)-adjacency matrix implementation.
• DegreeMatrix, InDegreeMatrix and OutDegreeMatrix represent sparse diagonal matrices of vertex degrees.
• IncidenceMatrix represents a sparse incidence matrix.

You can read the original Mendz.Graphs series from here.