System that finds the critical path of the graph of the disciplines of the Computer Science course at UnB (University of Brasília).
-
Updated
May 1, 2017 - C++
System that finds the critical path of the graph of the disciplines of the Computer Science course at UnB (University of Brasília).
Finding critical path on large graph using Bellman-Ford algorithm with parallel implementations
Add a description, image, and links to the critical-path topic page so that developers can more easily learn about it.
To associate your repository with the critical-path topic, visit your repo's landing page and select "manage topics."