Table of Contents
Graph Simulator
- Authors: Jakub Varadinek (bachelor thesis, 2013) and Otto Michalička (bachelor thesis, 2016-2017, unfinished)
- Requirements: Java Runtime Environment 1.7 (32-bit or 64-bit version of JRE)
- Features:
- Application with GUI in Java
- Language: English, Czech
- Algorithms: Breadth-First Search, Depth-First Search, Topological Sorting, Strongly-connected Components, Bellman-Ford and Dijkstra Algorithms
- Modes: Graph editing, Algorithm Simulation (stepping, breakpoints, variables)
- Download (version for Windows 7/10, maybe works also in Windows XP and Vista, not tested on Linux and Mac)
- Installation Notes:
- Decompress the archive on your Windows system and execute GraphSim.bat (you need to have Java in your PATH environment variable)
- Known Bugs (Please, send us new bug reports as well):
- The GUI language cannot be changed into Czech at the moment.
- Feature requests (to be implemented in the future):
- Keystroke shortcuts (configurable) for control of a simulation mode.
- The edge label cannot be moved along the edge, so sometimes the labels are overlapped.
- Add a comment to the graph (for example the assignment for students, or the description what the graph represents) - there will be an extra dialog to show/edit the comment.
- Extra button in simulation mode to run the algorithm until the end and just show the result.
- You cannot dictate the order of edges during the relaxations.
Additional Materials
- Slides for the lecture on Shortest Paths given at Segovia, March 16, 2017 (PDF)
- Paper describing the theory and basic properties of GraphSim:
- KŘIVKA Zbyněk. Introduction to Graph Algorithms for Shortest-Paths Problems. Sego-Bit. Segovia: Universidad de Valladolid, 2017, Volume 4, Number 5. ISSN 2386-866X.
Screenshots
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Noncommercial-Share Alike 4.0 International
