shortest-path-unweighted-graph-bsf-java

Find the shortest path between two nodes in an unweighted graph based on breadth first search algorithm

test case

            B          D
          .-+---------.'-------F
       .-'  |       .' |
    A.'     |     .'   |
      `.    |   .'     |
        `-. | .'       |
           `.'---------+
            C          E

• shortest path between A and F : A B D F
• shortest path between A and E : A C E
• shortest path between C and F : C D F

Reference:

• https://www.youtube.com/watch?v=oLtvUWpAnTQ
• https://www.youtube.com/watch?v=bD8RT0ub--0&t=461s