Need help with Algorithms
Hello people :rofl:
I am kind of having trouble with some part of my assignment, wonder if anyone can help me :biggrin:
Describe an algorithm that accpets a relation in adjacency lists format, and outputs its transitive closure in the same format.
Describe an algorithm that accepts a strong partial order in adjacency lists format, and outputs its minimal transitive reduction in the same format.
So far only know some part about Floyd-Warshall's algorithm
|All times are GMT -5. The time now is 09:18 AM.|
Powered by vBulletin Copyright ©2000 - 2013, Jelsoft Enterprises Ltd.
© 2012 Physics Forums