Daily Archives: November 1, 2005

DAGs and Topological Sorting.

For those of you into the geekier aspects of this, I’ve learned from some Computer Science people that a graph of this sort is called a “Directed Acyclic Graph”, and putting them into power rankings is called “Topological Sorting”. There’s tons of information out there about possible algorithms. Technorati Tags: beatpath