Skip to content

A simple program for finding strongly connected components of a directed graph. User draws the graph with the mouse and each strongly connected component is coloured differently. It was developed for the Algorithms course at AUEB.

License

xuzhikethinker/SCCFinder

Repository files navigation

Description

With this application you can create a directed graph and find its strongly connected components via a user-friendly graphical interface (the vertices of different strongly connected components are drawn in different colors).
The application runs under Linux, Windows and other operating systems (Sun Java Virtual Machine required).  
 
A runnable JAR file is provided. You can run the application with the following command:
java -jar SCCFinder.jar (you can double right click SCCFinder.jar if your operating system is Windows)

You can also download and compile the source code:
1. Download source code
2. Unzip it
3. Move to the directory that you unzipped the source code
2. javac appLaunch.java 
3. java appLaunch

The application is written in Java and uses jung2 open source project which can be found in http://jung.sourceforge.net/.
Jung2 files included in cern, corejava, edu, hep, org (with some minor changes) folders and non-jung2 files included in mathgraph and graphviewer folders.

This software is open-source under the BSD license, see "license.txt" for more information.

Author: Voulimeneas Alexios - avoulimeneas@gmail.com

About

A simple program for finding strongly connected components of a directed graph. User draws the graph with the mouse and each strongly connected component is coloured differently. It was developed for the Algorithms course at AUEB.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published