Skip to content

Latest commit

 

History

History
38 lines (20 loc) · 1.38 KB

README.md

File metadata and controls

38 lines (20 loc) · 1.38 KB

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.

BFS

DFS

Prim

Kruskal

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.