Need help with Algorithms

loveCS

Hello people

I am kind of having trouble with some part of my assignment, wonder if anyone can help me

a)
Describe an algorithm that accpets a relation in adjacency lists format, and outputs its transitive closure in the same format.
b)
Describe an algorithm that accepts a strong partial order in adjacency lists format, and outputs its minimal transitive reduction in the same format.


cheers..

So far only know some part about Floyd-Warshall's algorithm