I have one conjecture, need some1 to prove (for optimal pruning during DFS search)
Hi, my statement is that:\n\n\n"This path(or at least one of the best path)  won\'t contain duplicate directional edge. "\n\n\nI mean it can contain 0->1 and 1-
Hi, my statement is that:\n\n```\n"This path(or at least one of the best path)  won\'t contain duplicate directional edge. "\n```\n\nI mean it can contain 0->1 and 1->0, but it won\'t contian two 0->1.
[]