#
kosaraju
Here are 3 public repositories matching this topic...
Programs covered in DAA Lab during Semester 4
algorithms
quicksort
mergesort
dynamic-programming
longest-common-subsequence
minimum-spanning-trees
knapsack-problem
university-course
dijkstra-algorithm
hanoi-towers
kruskal-algorithm
branch-and-bound
prims-algorithm
kosaraju
edmonds-karp-algorithm
held-karp
-
Updated
Aug 11, 2020 - C
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.
tarjan
graphs
mpi
mpich
speedup
parallel-programming
kosaraju
strongly-connected-components
mpi-parallelization
-
Updated
Oct 13, 2023 - C
Improve this page
Add a description, image, and links to the kosaraju topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the kosaraju topic, visit your repo's landing page and select "manage topics."