#Construct graph that has specific DFS postorder and preorder conditions

3 messages · Page 1 of 1 (latest)

mellow ridge
#

I have a set of vertices and some vertices have certain conditions that might be imposed

For a given pair of vertices u and v, one of these 3 conditions have to hold true for that pair

  1. The starting and finishing time of u contain the starting and finishing times of u
  2. The finishing time of u must be before the finishing time of v
  3. No condition

Now given a set of these conditions, have to make an algorithm that states whether a graph with such a depth first traversal exists?

undone craterBOT
#
  1. Wait patiently for a helper to come along.
  2. Once someone helps you, say thank you and close the thread with: ```diff
    +close