Description of the graph.
Possible lines:

• vertex [label] [x coordinate] [y coordinate]
• edge [source label] [target label] [weight]

Load the sample graph

vertex A 60 100 vertex B 200 0 vertex C 400 0 vertex D 400 200 vertex E 200 200 vertex F 600 0 vertex G 600 200 vertex H 740 100 vertex I 500 100 edge A B 40 edge B C 20 edge A E 10 edge E B 25 edge C I 30 edge C E 15 edge E D 10 edge D C 50 edge F G 20 edge G H 20 edge H F 20 edge F C 5 edge G D 90 edge D I 30 edge G I 30 edge F I 30

view the representations
run the Depth First Search (DFS) algorithm
run the Breadth First Search (BFS) algorithm
run the Dijkstra algorithm
run the Floyd-Warshall algorithm

---

---

---

---

see the C++ source code and other visualizations (graphs.cpp)