UnDirected Graph Cycle Detection: C++ wrapper over Boost Graph Library (BGL)
-
Updated
Jul 29, 2023 - C++
UnDirected Graph Cycle Detection: C++ wrapper over Boost Graph Library (BGL)
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.
University project on Rectilinear Steiner Trees
Repository with code for learning how to use the Boost Graph Library
C++ Graph Strong Components Detection (see presentation.pdf)
My solutions and notes of Algorithm Lab 2021HS in ETHZ.
Linux 64 bit Qt for Bitgesell (BGL) is an experimental digital currency
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."