Skip to content

HTTPS clone URL

Subversion checkout URL

You can clone with
or
.
Download ZIP
Implementations of graph algorithms using BOOST & LEDA
C++
branch: master

Fetching latest commit…

Cannot retrieve the latest commit at this time

Failed to load latest commit information.
kruskal_mst
str_comp
README.md

README.md

Advanced Algorithms Implementations
(using Boost & Leda).

Content of this repository

  • [kruskal_mst] presents a simple implementation of Kruskal's Algorithm for finding minnimum spanning trees on connected undirected graphs. There are also two helper functions for transforming Boost Graphs to Leda Graphs and vice versa.
    Implented using Boost & Leda Library

  • [str_comp] presents the implementation of an algorithm for finding strong components on a directed graph and a checker function that verifies it's correctness.
    Implemented using Leda Library.

In case you want to use this repository be carefull, this code comes with ABSOLUTELY NO WARRANTY!

Gryllos Prokopis
Upatras 2013-2014

Something went wrong with that request. Please try again.