vinal (VIsualize Network ALgorithms)

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

• Shortest path problem

  • Dijkstra’s algorithm

• Minimum Spanning Tree (MST)

  • Prim’s Algorithm

  • Kruskal’s Algorithm

  • Reverse Kruskal’s Algorithm

• 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.

• Quickstart Guide
  • Installation
  • Tutorial
• Examples
  • Furthest Insertion on 7x7 Grid
  • 2-OPT on 9x9 Grid
  • Prim’s on Ithaca
  • Dijkstra’s on Ithaca
  • Assisted Prim’s Algorithm
  • Assisted Dijkstra’s on Ithaca
• Documentation
  • vinal package
    • vinal.build module
    • vinal.algorithms module
    • vinal.plot module