Graph Theory Problem

Dave Smith dave at
Fri Dec 12 21:50:44 MST 2008

I came across a graph theory problem at work today, and I decided to 
write it up to sort out the details. In the mean time, I challenge you 
to solve it:

For those who can't be troubled to follow links, here's the problem 
summarized: Given any directed graph as a set of edges, find the parent 
most node or nodes (e.g., the nodes that have the most ancestors).


More information about the PLUG mailing list