I should never be surprised by PerlMonks, but I was surprised by how many nodes cover "topological sort"s:
- Sort Algorithm (recursive?)
- Task scheduling using perl
- Dependency Inference
- How do I use Graph::Traversal?
- In search of an algorithm for loading cyclic graphs
- Order your autobundle by dependency
- The Lighter Side of Perl Culture (Part IV): Golf
- Problems with sorting
- Priority Sorting Challenge
- "Intelligent" array joining
- Parse C-like define statements
- Rolling a biased die
- where do you put your subs
- Sorting, given only comparisions
- Topological Sort in Perl
- Gantt Diagrams
The best subtitle, however, simply must go to Gantt Diagrams... ;-)
HTH,
In reply to Re: Reconstructing List Order From Partial Subsets
by planetscape
in thread Reconstructing List Order From Partial Subsets
by QM
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |