Graph Representation using Adjacency Matrix: Program

[@_Manikandan_s]

Ethil bfs thett alle
1,2,4,3 alle vanrande

[@majid127x]

nop 2 3 and 4 are adjacent of 1 so first it will visit 1 in the order 1 , 2 , 3 , 4 ,, BFS travels in breadth order so first it have to visit all nodes in the same level here 2 3 4 are in the same level.

[@amjathps4317]

Disconnected graphin ith working allsllo

[@pharikrishnan2513]

Maam ktu S6 2019 scheme programme in python upload cheyyavo please