breadth-first search is graph search algorithm that begins at the root node and explores all the neighbouring nodes then for each of those nearest nodesthe algorithm explores their unexplored neighbour nodesand so onuntil it finds the goal the depth-first search algorithm progresses by expanding the starting node of and thus going deeper and deeper until goal node is foundor until node that has no children is encountered spanning tree of connectedundirected graph is sub-graph of which is tree that connects all the vertices together kruskal' algorithm is an example of greedy algorithmas it makes the locally optimal choice at each stage with the hope of finding the global optimum dijkstra' algorithm is used to find the length of an optimal path between two nodes in graph exercises review questions explain the relationship between linked list structure and digraph what is graphexplain its key terms how are graphs represented inside computer' memorywhich method do you prefer and why consider the graph given below (awrite the adjacency matrix of (bwrite the path matrix of (cis the graph biconnected(dis the graph complete(efind the shortest path matrix using warshall' algorithm consider the graph given below state all the simple paths from to db to dand to alsofind out the in-degree and out-degree of each node is there any source or sink in the grapha consider the graph given below find out its depth-first and breadth-first traversal scheme explain the graph traversal algorithms in detail with example draw complete undirected graph having five nodes consider the graph given below and find out the degree of each node differentiate between depth-first search and breadth-first search traversal of graph explain the topological sorting of graph define spanning tree when is spanning tree called minimum spanning treetake weighted graph of your choice and find out its minimum spanning tree explain prim' algorithm write brief note on kruskal' algorithm write short note on dijkstra' algorithm