I have come across an exam review question that I am stuck on. The question states:
Use topological sort to compute a valid linear order of the elements for the following Hasse Diagram:
This is what I was able to come up with: e, c, b, j, m, l, a, i, k, d, u, t, s, r, g, o, h, p, f, n
I am also certain this isn't correct..
Any Explanation is much appreciated!