You start with some research.
Shortest path problem - Wikipedia
Then you decide on a data structure to represent " The adjacency list for the graph."
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.
