Graph implementations

Let us create an ADT (Graph_ADT) for the implementation of functions on a given graph. The key features of ADT for a given graph analysis are the following:

• Fixed number of vertices

• Provision for addition and deletion of edges

• Provision to support a mark array, which can assist algorithms in traversing along the graph

The vertices are denoted using non-zero integer values, and can additionally store vertex names or some kind of application-based predetermined values.

The following are some ADT functions that are widely used for implementing graph functions:

• num_vert: This function returns the number of vertices for a given graph.

• num_edge: This function returns the number of edges for a given graph.

• weightEdge: This function returns the weight of an edge connecting two adjacent vertices. Its input is a pair of two connected vertices and its output is a numeric value indicating its weight.

• assignEdge: This function is used to assign weight to a given edge of a graph. The...