12.7SUMMARY

•A graph is a collection of vertices (nodes) and edges that connect these vertices.

•The degree of a node is the total number of edges incident to that particular node.

•A graph G (V, E) is known as a complete graph if, and only if, every node in the graph is connected to another node and there is no loop on any of the nodes.

•An adjacency matrix is usually used to represent the information of the nodes which are adjacent to one another. The adjacency matrix is also known as a bit matrix or Boolean matrix because it contains only 0s and 1s.

•In adjacency list representation, every node is linked to its list of all the other nodes which are adjacent to it.

•Traversing in a graph is the process of visiting each node and edge in some systematic approach.

•Breadth-First Search is a traversal technique that uses the queue as an auxiliary data structure for traversing all the member nodes of the graph. In this technique, we select...