The shortest path problem can be defined for graphs whether undirected, directed, or mixed. Here it is defined for undirected graphs; for directed graphs the definition of path requires that consecutive vertices be connected by an appropriate directed edge.[1]