Hello everyone!↵
I have created a tool to create graphs and visualise graph algorithms — Graph Visualiser. It can be used to visualise graph algorithms in a step-by-step fashion. By adding just a few lines in your code of an algorithm, you can create a list of animation events which can then be viewed by the app.↵
↵
[pic](https://drive.google.com/open?id=1xSXwHbx7EGDNB-cahY-dIflQuLZ3-1GO)↵
Here I have used the app to demonstrate Tarjan's algorithm to find Strongly Connected Components.↵
↵
[pic](https://drive.google.com/open?id=19BafkNbZWql4oNj24qBy07CanaVwfybK)↵
Here I have used the app to demonstrate Kruskal's algorithm to find Minimum Spanning Tree.↵
The animations are created using the GraphAnimator library (available for C++ and Java).↵
↵
You can also create graphs in the app as shown below.↵
[pic](https://drive.google.com/open?id=1JHeNdwrEJCu5AGjQDUw0Np0jrkdBTdWo)↵
↵
Download Graph Visualiser:-↵
[Windows](https://goo.gl/yUXZZG)↵
[Linux](https://goo.gl/vhZxW5)↵
↵
EDIT: Note to Linux users: The setup requires you to copy some files into /usr/lib/x86_64-linux-gnu. Some files might be replaced. Please take a back up of these files or try using LD_LIBRARY_PATH for dynamic linking.↵
↵
The zip file contains a pdf which has instructions on how to setup the app as well as information on all the features provided by the app. The zip file also contains sample codes.↵
↵
Demos:-↵
[Demo 1](https://www.youtube.com/watch?v=MrU-Pdg7ikY)↵
[Demo 2](https://www.youtube.com/watch?v=UAmXKYyv48U)↵
[Demo 3](https://www.youtube.com/watch?v=nFtBJz7KSck)↵
↵
Happy Coding and Happy New Year in advance!
I have created a tool to create graphs and visualise graph algorithms — Graph Visualiser. It can be used to visualise graph algorithms in a step-by-step fashion. By adding just a few lines in your code of an algorithm, you can create a list of animation events which can then be viewed by the app.↵
↵
[pic](https://drive.google.com/open?id=1xSXwHbx7EGDNB-cahY-dIflQuLZ3-1GO)↵
Here I have used the app to demonstrate Tarjan's algorithm to find Strongly Connected Components.↵
↵
[pic](https://drive.google.com/open?id=19BafkNbZWql4oNj24qBy07CanaVwfybK)↵
Here I have used the app to demonstrate Kruskal's algorithm to find Minimum Spanning Tree.↵
The animations are created using the GraphAnimator library (available for C++ and Java).↵
↵
You can also create graphs in the app as shown below.↵
[pic](https://drive.google.com/open?id=1JHeNdwrEJCu5AGjQDUw0Np0jrkdBTdWo)↵
↵
Download Graph Visualiser:-↵
[Windows](https://goo.gl/yUXZZG)↵
[Linux](https://goo.gl/vhZxW5)↵
↵
EDIT: Note to Linux users: The setup requires you to copy some files into /usr/lib/x86_64-linux-gnu. Some files might be replaced. Please take a back up of these files or try using LD_LIBRARY_PATH for dynamic linking.↵
↵
The zip file contains a pdf which has instructions on how to setup the app as well as information on all the features provided by the app. The zip file also contains sample codes.↵
↵
Demos:-↵
[Demo 1](https://www.youtube.com/watch?v=MrU-Pdg7ikY)↵
[Demo 2](https://www.youtube.com/watch?v=UAmXKYyv48U)↵
[Demo 3](https://www.youtube.com/watch?v=nFtBJz7KSck)↵
↵
Happy Coding and Happy New Year in advance!
