/BFS-calculate-shotest-path

Get some graph information, find the shortest way between two vertices

Primary LanguageC++

Find the shortest between two vertices in undirected graph

The code basically do:

  • 1.Wait for user to input graph information. For example:

V 5

E (<0,1>,<1,4>,<2,3>)

  • 2.Find the shortest way between two vertices using BFS.