Shortest path in an unweighted graph
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
Last edited by cquestions; 10-11-2020 at 08:25 PM.
You start with some research.
Shortest path problem - Wikipedia
Then you decide on a data structure to represent " The adjacency list for the graph."
If you dance barefoot on the broken glass of undefined behaviour, you've got to expect the occasional cut.
If at first you don't succeed, try writing your phone number on the exam paper.
