Need help with Algorithms

  1. Hello people :rofl:

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

    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.. :uhh:

    So far only know some part about Floyd-Warshall's algorithm
     
  2. jcsd
Know someone interested in this topic? Share a link to this question via email, Google+, Twitter, or Facebook

0
Draft saved Draft deleted