*A Python package for visualizing graph algorithms*

GitHub Page | Website

vinal is a Python package for visualizing graph/network algorithms. Currently, the following algorithms are implemented:

- Shortest path problem
- Minimum Spanning Tree (MST)
- Travelling Salesman Problem (TSP)
- Random neighbor
- Nearest neighbor
- Nearest insertion
- Furthest insertion
- 2-OPT

NetworkX graphs can be constructed from a single `.csv`

file of node locations. Alternatively, one can specify edges of the graph by providing an additional `.csv`

file of edges. The package relies on bokeh to generate standalone HTML files which can be viewed in a Jupyter Notebook inline or in a web browser.