Dijkstra Algorithm Questions
A connected graph is a graph in which there is a path between every pair of vertices. In other words, for any two vertices in a connected graph, there exists a sequence of edges that can be followed to travel from one vertex to the other.