tejb96 / graphs Goto Github PK
View Code? Open in Web Editor NEWThe program prompts the user to input the number of nodes and edges, followed by the edges in the format of endpoints (u, v). It constructs the adjacency matrix and performs BFS traversal to visit all nodes. Finally, it displays the adjacency matrix and the BFS visit sequence of the graph.