https://github.com/devkral/spaceflib
spaceefficient graph algorithms, stripped down version (needs maybe refactoring for working version, currently no active development)
https://github.com/devkral/spaceflib
Last synced: 5 months ago
JSON representation
spaceefficient graph algorithms, stripped down version (needs maybe refactoring for working version, currently no active development)
- Host: GitHub
- URL: https://github.com/devkral/spaceflib
- Owner: devkral
- License: other
- Created: 2020-01-30T21:13:30.000Z (almost 6 years ago)
- Default Branch: master
- Last Pushed: 2020-04-14T19:36:39.000Z (over 5 years ago)
- Last Synced: 2025-04-03T00:12:33.358Z (7 months ago)
- Language: C++
- Homepage:
- Size: 14.3 MB
- Stars: 0
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
Setup:
======
git submodule init # prepare subrepositories
git submodule update # fill subrepositories
cd ./build
cmake ..
Usage:
======
Switch to build directory
./test/print_graph -g=-1 # use inbuild graph to analyse
./test/print_graph -g= # connect to server (default localhost) on port and analyse remote graph
./test/print_graph -g= -f true # show only cutvertices and connected components
./test/test_spacef -g= # tests library against graph (can use external server)
Documentation:
--------------
see build/docs/index.html
Note:
=====
This repo only contains my own code. It lacks the graph server