| | |
Enter four integers separated by spaces that give the number of vertices, number of directed edges, and a start and finish vertex for a graph, respectively. A random weighted digraph with these parameters will be created and the shortest path from the starting vertex to the finishing vertex will be found (if it exists) in accordance with the A* algorithm.