Still using the graph from Exercise 1, write a Windows application that allows the user to search for a vertex in the graph using either a depth-first search or a breadth-first search.
Exercise 1
Build a weighted graph that models a map of the area where you live. Use Dijkstra's algorithm to determine the shortest path from a starting vertex to the last vertex.