Mendz.Graphs Dense Matrices

Mendz.Graphs provides a set of concrete dense matrix implementations that can be used in operations that support two-dimensional arrays (T[,]).

Summing up, Mendz.Graphs provides the following dense matrix classes/types:

• 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 (a, b, c)-adjacency matrix implementation.
• DegreeMatrix, InDegreeMatrix and OutDegreeMatrix represent dense diagonal matrices of vertex degrees.
• IncidenceMatrix represents a dense incidence matrix.

Remember that Mendz.Graphs is not a intended to be a Math library. Mendz.Graphs is all about graph data and representing them. Thus, the focus of Mendz.Graphs.Representations.Matrices is how that "rectangular array" mentioned in the matrix definition can be created, initialized and filled with graph data. The matrices that you create using Mendz.Graphs can be passed to Math libraries that support operations with matrices. There are many .Net compatible Math/numerical libraries available like Math.NET, ALGLIB and MATLAB. See also this list from Wikipedia. A quick search works to find them, too!

Mendz.Graphs intentionally does not include algorithms. I encourage developers to build their own algorithm library or libraries based on Mendz.Graphs.