Adjacency Matrix

Testing Directed or Undirected Graph From Adjacency Matrix

Submitted by Arup Kr Goswami on
This is a simple C source code written in gcc paltform (Ubuntu, Linux). It tests whether the adjacency matrix represents Directed or undirected graph. Actually This reads a text file & then checks the above condition. Change the path of the text file in code. Thanks.

Testing Weighted or Unweighted Graph From Given Adjacency Matrix

Submitted by Arup Kr Goswami on
This is a simple C source code written in gcc paltform (Ubuntu, Linux). It tests whether the adjacency matrix represents Weighted or unweighted graph. Actually This reads a text file & then checks the above condition. Change the path of the text file in code. Thanks.

Check Number of Isolated Vertices & Pendent Vertices from Adjacency Matrix

Submitted by Arup Kr Goswami on
This is a simple C source code written in gcc paltform (Ubuntu, Linux). It checks that how many Isolated vertices & pendent vertices are contained in the graph represented by the adjacency matrix. Isolated vertex has degree zero & pendent vertex has degree one. Hope it will help others. Thanks.

Check Number of Self-loop & Parallel Edges From Adjacency Matrix

Submitted by Arup Kr Goswami on
Hello, This is a simple C source code written in gcc paltform (Ubuntu, Linux). It tests that how many self-loop & parallel edges are contained in the graph represented by the adjacency matrix. Also it checks that which vertices contain only self-loop. Self-loop is an edge which has the same initial & termination point.

Testing Regular Graph From Adjacency Matrix

Submitted by Arup Kr Goswami on
Hello, This is a simple C source code written in gcc paltform (Ubuntu, Linux). It tests whether the adjacency matrix represents a Regular Graph or not. Basically a Regular graph is a graph, in which all vertices have equal degree. Let each & every vertex has degree x, then the graph is called as x-regular graph.

Testing Complete Graph From Adjacency Matrix

Submitted by Arup Kr Goswami on
Hello, This is a simple C source code written in gcc paltform (Ubuntu, Linux). It tests whether the adjacency matrix represents a Complete Graph or not. Actually This reads a text file, Adjacency.txt & then checks the above condition. Please correct the path of Adjacency.txt in the code. Thanks.

Testing Degree of Vertices Along with Degree of Graph from Adjacency Matrix

Submitted by Arup Kr Goswami on
Hello, This is a simple C source code written in gcc paltform (Ubuntu, Linux). It tests the degree of all vertices along with the degree of graph from text file of adjacency matrix. Actually This reads a text file & then checks the above condition. Hope, It will help others. Thanks.