• choose an algorithm
    breadth-first search depth-first search kruskal MST Dijkstra shortest-path
1-select one source vertex
1-select first vertex
2-select second vertex
graph has to be weighted!
graph has to be weighted and undirected!