PyGraphArt

I wrote this code some time ago with the purpose of learning graph algorithms while enjoying it, through the creation of animated images that show how different graph algorithms work.

So through this code you can do something as follows.

Breadth-First Traversal

BFS

Depth-First Traversal

DFS

Prim's Algorithm

Prim

Kruskal's Algorithm

Kruskal

Dijkstra's Algorithm

Shortest paths from Milano: Dijkstra 1

Shortest paths from Roma: Dijkstra 2

Shortest paths from Napoli: Dijkstra 3

Note that some function may be bugged.

Thank @inconvergent for render.py that I somehow edited a bit.