Connected Graph A graph is said to be connected if there is a path between any two of its nodes. Cycle A Path from a node to itself is called a Cycle. A rgaph must require at least 3 nodes to form a cycle. Tree A Tree is a connected graph without cycles. Spanning Forests A…

There are many in-inadequacies in using the Adjacency Matrix representation of Graphs. Once such inadequacy is the difficulty in adding or deleting nodes while data is to be updated dynamically. Another inadequacy is that even if there exists no arc between two nodes, space must be reserved for the same in the array. Such inadequacies…