Graph Visualizer

Description

The Graph Visualizer provides a graphical user interface for visualizing graphs, analyzing them using a variety of algorithms, and saving the results.

Provided algorithms

Basic algorithms

• ForceAtlas2 - to lay out a graph on a plane
• LeaderRank - to highlight key vertices
• Louvain clustering method - to find communities

Classical algorithms

• Tarjan's strongly connected components
• Tarjan's bridge-finding
• Finding cycles for a given vertex
• Kruskal's algorithm
• Prim's algorithm
• Dijkstra's algorithm
• Bellman-Ford algorithm

Saving graphs

The application provides tools for saving and loading graphs:

• file in JSON format
• SQLite DB
• Neo4j DB

Chips and Features

• You can create edges in a graph in 2 ways:

  1. Swipe down in the vertex menu area, the edge menu will appear, in which you can create the required edge

  2. Click on the vertex you want to link and, while holding down the "Shift", click on the vertex you want to create an edge to

• Icon "Save the Graph"	Icon "Reset the Graph"

• When creating a graph with a database of the "Neo4j" type, you must specify the full link in the "Host" field, for example "bolt://localhost:7687"

Getting started

To run building application execute command:

# Clone this repo
git clone https://github.com/spbu-coding-2023/graphs-graphs-12.git

# Build
./gradlew build

# Run 
./gradlew run

Some Screenshots

Main Screen	Graph Page

Settings	Create New Graph

Authors

• @IliaSuponeff
• @RodionovMaxim05
• @Friend-zva

License

Distributed under the MIT License. See LICENSE for more information.

(back to top)