Activity is now locked.
Responses are not accepted at this time.
If I give you a digraph G and tell you it is a binary search tree, and you also have a BST implementation on hand, can you do a topo sort for G easier than implementing a Topo Sort directly?
0
Good question ... I wonder what the answer is
Yes, I would just ... what?
No I would need to write the algorithm we did in class
Powered by