Skip to content

Biserkov/Parallel-Graph-Algorithms

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

9 Commits
 
 
 
 
 
 
 
 

Repository files navigation

This is my course project for "Introduction to Parallel Programming", winter 2010 @ FMI Sofia.

Right now, it implements a parallel modification of the O(n3) Warshall algorithm for finding the transitive closure of a graph in O(n) time on n2 processors.

Run it like this mpiexec -n 16 somename.exe 4 "input4.txt" "output4.txt"

Slides in Bulgarian.

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published