Problem Set 6: Graph

Do all the Operation Once for each of the following types of Graph

• Undirected Unweighted Graph

• Undirected Weighted Graph

• Directed Unweighted Graph

• Directed Weighted Graph

Problem Set 9: Graph

1. Represent a Graph using an Adjacency Matrix

   • Initialize the Adjacency Matrix

   • Input the Graph using an Adjacency Matrix

   • Create the following function

     • Input the number of Vertices and Edges

     • Add a new edge to the graph

     • Delete an edge from the graph

     • Add a new vertex to the graph

     • Delete a vertex from the graph

     • Print the Adjacency Matrix

     • Print the Adjacency List

     • Print the Edge List

     • Print the Degree (In-Degree, Out-Degree, Total Degree) of each Vertex

     • Test whether an Edge Exist or Not

     • Test whether two Vertices are Adjacent/Neighbor or Not

2. Represent a Graph using an Adjacency List

   • Declare the Adjacency List

   • Input the Graph using an Adjacency List

   • Create the following function

     • Add a new edge to the graph

     • Delete an edge from the graph

     • Add a new vertex to the graph

     • Delete a vertex from the graph

     • Print the Adjacency Matrix

     • Print the Adjacency List

     • Print the Edge List

     • Print Degree (In-Degree, Out-Degree, Total Degree)

     • Test whether an Edge Exist or Not

     • Test whether two Vertices are Adjacent/Neighbor or Not