GLAM: Graph Layout Aesthetic Metrics
-
Updated
Jun 6, 2024 - C++
GLAM: Graph Layout Aesthetic Metrics
UnDirected Graph Cycle Detection: C++ wrapper over Boost Graph Library (BGL)
Analyse the lightning network graph
C++ Alternative Routing Library for Boost.Graph. A configurable, efficient, plug-n-play solution for alternative route planning and k-shortest paths problems.
There is given an undirected graph G = (V, E) from which edges are deleted one at a time. Questions like "Are the vertices u and v in the same connected component?" have to be answered in constant time.
Parallel computing: Infectious Disease Modeling with OpenMP. Agent based modelling on Undirected Acyclic graphs.
Generate dynamic networks visualizations using the Boost Graph Library
A simple tool to deal with circular dependencies in C/C++.
Prototype using Boost C++ Graph Library of SeqDFS algorithm for static mutable graphs taken from research paper by Dr. Qiuyi Lyu, Dr. Bin Gong, Dr. Mo Sha, and Dr. Kuangda Lyu
A uniform API for using different graph libraries and types
Repository with code for learning how to use the Boost Graph Library
C++ Graph Strong Components Detection (see presentation.pdf)
Implementations of several path coloring algorithms for the Boost Graph Library.
Advanced Algorithms and Parallel Programming exam project
Implementation of the Max Flow Preflow-Push algorithm with excess scaling method using Boost Graph Library
Add a description, image, and links to the boost-graph-library topic page so that developers can more easily learn about it.
To associate your repository with the boost-graph-library topic, visit your repo's landing page and select "manage topics."