use parallel algorithms to compute the transitive closure of a directed graph and detect nontrivial cycles in parallel time O(log n). Both algorithms require n3 processors, where n is the number of nodes in the directed graph. also show the detection of k-cycles (cycles of length 1<_ k <_ n) can be achieved in parallel time O(log k) using n^3 processors. implement this using ur number, and write a report about this
## Deliverables
use parallel algorithms to compute the transitive closure of a directed graph and detect nontrivial cycles in parallel time O(log n). Both algorithms require n3 processors, where n is the number of nodes in the directed graph. also show the detection of k-cycles (cycles of length 1<_ k <_ n) can be achieved in parallel time O(log k) using n^3 processors. implement this using ur number, and write a report about this
## Platform
C++ and a report about it