Tek-Tips is the largest IT community on the Internet today!

Members share and learn making Tek-Tips Forums the best source of peer-reviewed technical information on the Internet!

Register Log in
  • Congratulations IamaSherpa on being selected by the Tek-Tips community for having the most helpful posts in the forums last week. Way to Go!

Search results for query: *

  1. bean1975

    Nested Sets: When an element has more than one parent

    It turns out that I was looking for a topological sort of said DAG. I'll post more as I find it out.
  2. bean1975

    Nested Sets: When an element has more than one parent

    Please read http://en.wikipedia.org/wiki/Directed_acyclic_graph . Sorry for using graph theory so light handed.
  3. bean1975

    Nested Sets: When an element has more than one parent

    I was thinking on this quite a bit and I think the answer.You are trying to find descendants of a given node. Or, in other words, you are trying to find whether a path exists between X and Y in a DAG. If there is a path X->A->B->C->Y then you can ignore the edge X->Y because you already found a...

Part and Inventory Search

Back
Top