A graph G can be represented with an adjacency matrix of G. If the matrix is symmetrical the graph is undirected. If the coefficients of the matrix are only 0 or 1, then G is an unweighted graph.
Determine basic properties from Graph Theory:
Degrees of G, diameter of G, connected components of G, Cycles, Bipartite, Eulerian cycles, semi-Eulerian cycles, Hamilton cycles, semi-Hamilton cycles, trees (MST), shortest path heuristic.
Plotting can be with a spectral graph plot, or try to implement a visualization with GraphViz.
darkeclipz
commented
5 years ago
Add support for graphs.
A graph G can be represented with an adjacency matrix of G. If the matrix is symmetrical the graph is undirected. If the coefficients of the matrix are only 0 or 1, then G is an unweighted graph.
Determine basic properties from Graph Theory: