Given an unweighted graph, a source and a destination, how can I find shortest path from source to destination in the graph in most optimal way? I need help in writing this program in C.
Sample input and output:
Input: source vertex = 0 and destination vertex is = 7.
The adjacency list for the graph.
Output: Shortest path length is:2
Path is: 0 3 7