### Question

Can there be more than one path between any two points?

### Answer

Yes, this is definitely possible, and happens quite frequently in graphs, especially ones that have lots of connections.

Some pathfinding algorithms are created in order to find the shortest possible path, out of all possible paths, between two points, such as Dijkstra’s algorithm, or the Bellman-Ford algorithm.

For example, in a map, where each building is a vertex, and the roads are the edges, there can be multiple paths between any two locations., some being shorter or longer than the other paths.