|Share this thread:|
May29-06, 05:54 AM
I am kind of having trouble with some part of my assignment, wonder if anyone can help me
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
|Register to reply|
|Discrete algorithms.||Calculus & Beyond Homework||1|
|Help with an algorithms||Precalculus Mathematics Homework||1|
|Need help in factoring algorithms||Linear & Abstract Algebra||13|
|Course on Data structures and algorithms||Computing & Technology||14|
|Resources on proving algorithms correct?||General Math||3|