Breadth and depth first search implementation in CSharp - part 2

More details and explanations about how to use the breadth and depth search methods. We'll execute a test case using the Romania map, print the traveled paths in the screen, calculate the shortest path possible between two cities using Dijkstra's algorithm and print such a path in the screen. The complete code is available at the end of the post!