A simple drag and drop application to help visualise various graph algorithms
Project description
Node Demonstrator
Building a drag and drop desktop (Tkinter) application to help visualise various graph algorithms.
Current progress
- drag and drop interface to build a graph
- can be weighted or unweighted
- in "node" mode...
- drag to move a node and associated edges
- double-click to rename nodes, if the default names aren't sufficient
- double-right click to delete a node
- in "edge" mode...
- drag to rotate a loopback edge out of the way
- double-click to change the weight of an edge
- double-right click to delete an edge
- choice of stepped or timed trace of supported algorithms
- available algorithms
- breadth-first / depth-first from a given start point (with or without end point, ie traversal and/or search)
- Dijkstra and A* shortest path
Usage
- Currently, this project uses the tweaked version of CustomTkinter that needs to be obtained directly from here until the submitted PR is approved into the main project.
- To run, install package then launch with "python -m nodemon"
Future algorithm support
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
nodemon-0.0.13.tar.gz
(59.0 kB
view hashes)
Built Distribution
nodemon-0.0.13-py3-none-any.whl
(55.8 kB
view hashes)