In mathematics, in graph theory, the Seidel adjacency matrix of a simple graph G (also called the Seidel matrix and—the original name—the (1,1,0)-adjacency matrix) is the symmetric matrix with a row and column for each vertex, having 0 on the diagonal and, in the positions ...
publicvoidGenerateDotFile(){vargraph =newAdjacencyGraph<string, TaggedEdge<string,string>>();for(inti =0; i < Math.Sqrt(Convert.ToDouble(m_Matrix.Length)); i++) { graph.AddVertex(String.Format("{0}", i)); }for(inti =0; i < Math.Sqrt(Convert.ToDouble(m_Matrix.Length)); i++)...