This app enables users to visualize and analyze graphs using gui. Application supports modern (later 2006) and classic graph algorithms, allowing for analysis and visualization.
- Supported graphs:
- weighted or unweighted
- directed or undirected
- Saving and reading with SQLite, neo4j or in .svs file
- High closeness centrality vertices
- Detecting communities
- Layout
- Сlassic algorithms (SCC, SSSP, finding cycles, etc.)
git clone [email protected]:spbu-coding-2023/graphs-team-9.git
cd graphs-team-9
./gradlew runArticles with general algorithms:
- Jacomy, Mathieu and Venturini, Tommaso and Heymann, Sebastien and Bastian, Mathieu (2014). ForceAtlas2, a Continuous Graph Layout Algorithm for Handy Network Visualization Designed for the Gephi Software. 10.1371/journal.pone.0098679
- Blondel, Vincent D; Guillaume, Jean-Loup; Lambiotte, Renaud; Lefebvre, Etienne (2008). "Fast unfolding of communities in large networks". Journal of Statistical Mechanics: Theory and Experiment. 10.1088/1742-5468/2008/10/P10008
- Ufimtsev, Vladimir and Bhowmick, Sanjukta (2014). An Extremely Fast Algorithm for Identifying High Closeness Centrality Vertices in Large-Scale Networks. Link
Implementations:
- forceatlas2, GPL-3.0 license
- louvain, Apache-2.0 license
This project uses the GNU General Public License v3.0. See the LICENSE for more info.