Graph algorithms in c
-
Updated
Nov 18, 2019 - C
Graph algorithms in c
Finding strongly connected components in graphs
This repository stores a project whose aim is to parallelize some algorithms for the search of the strongly connected components of a graph. The parallelization method has been applied both on the Tarjan and Kosaraju algorithms.
This C program finds & outputs the strongly connected components of a directed, connected graph. See "DirectedConnectedGraph.txt" for an example input.
Analysis and Synthesis of Algorithms (ASA) Course Project (Grade: 20/20) - IST - 2017/2018
Add a description, image, and links to the strongly-connected-components topic page so that developers can more easily learn about it.
To associate your repository with the strongly-connected-components topic, visit your repo's landing page and select "manage topics."