Graph analysis app
Application for graph visualization. Has the ability to work with Directed, Undirected, Weighted, Unweighted graphs.
Algorithms
Layout
PathFinding
MST
Communities
Key vertices
Other
- Find Bridges
- Find cycle for vertex
- Articulated vertices Tarjan
- SCC naive
Input/Output operations
- Load any graph into this app if it's represents CSV with adjacency matrix.
- Find some graph files in csv format in examples directory.
- Store current app state into Neo4J or SQLite or JSON databases.
Installation and launch
- Installation
git clone https://github.com/spbu-coding-2023/graphs-graph-10.git - Launch
./gradlew run
Some illustrated examples of work
Communities
Louvain algorithm is used to find communities
Find Cycle
You need to select one vertex and the app will draw all the cycles passing through this vertex
Articulated vertices
To implement the functionality, the Tarjan algorithm is used
Find key vertices
In order to identify the most important or influential vertices in the graph, used Leader Rank function, which accepts 2 parameters of the Double type
Path Finding
In our app, you can find the path between two vertices using 3 algorithms
All 3 algorithms identify the minimum path between two vertices
An example would be Dijkstra algorithm
Draw MST
The application supports 2 algorithms: Kruskal and Prim