Graph as Adjacency Matrix
Set B
a) Write a C program that accepts the vertices and edges of a graph and store it as an adjacency matrix. Implement function to traverse the graph using Breadth First Search (BFS) traversal.
b)
Write a C program that accepts the vertices and edges of a graph and
store it as an adjacency matrix. Implement function to traverse the
graph using Depth First Search (BFS) traversal.
a) Write a C program that accepts the vertices and edges of a graph and store it as an adjacency matrix. Implement function to traverse the graph using Breadth First Search (BFS) traversal.
0 Comments:
Post a Comment