C++ Graph Strong Components Detection (see presentation.pdf)
-
Updated
Jul 21, 2018 - C++
C++ Graph Strong Components Detection (see presentation.pdf)
My solutions and notes of Algorithm Lab 2021HS in ETHZ.
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.
Repository with code for learning how to use the Boost Graph Library
Small python library to parse Microsoft Flight Simulator X object model (.mdl) and scenery (.bgl) files
Linux 64 bit Qt for Bitgesell (BGL) is an experimental digital currency
Lightweight backend for bgl (bitgesell) light wallets
Converts Babylon dictionaries (*.bgl) to the open-source ODict format
Project based on the comparison of the Auction Algorithm and the Maximum Weighted Maching from Boost Library C++
University project on Rectilinear Steiner Trees
Bitgesell Wallet - сross-platform wallet for BGL cryptocurrency.
UnDirected Graph Cycle Detection: C++ wrapper over Boost Graph Library (BGL)
Analysis scripts for log data sets used in anomaly detection.
Add a description, image, and links to the bgl topic page so that developers can more easily learn about it.
To associate your repository with the bgl topic, visit your repo's landing page and select "manage topics."