Kruskal's strong components graph algorithm
C++ Makefile
Switch branches/tags
Nothing to show
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Failed to load latest commit information.
kruskal_mst
str_comp
README.md

README.md

Advanced Algorithms Implementations

Requirements

In order to run the test you are going to need a version of C++ installed and also the libraries BOOST and 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!

-- Author
Gryllos Prokopis gryllosprokopis@gmail.com
Upatras 2013-2014

--