Topological Sort of Project Euler problems by Solvability.

[pim.mfs.0]

Is it possible to provide a predecessor-successor relationship among Project Euler problems by solvability? i.e. if someone has solved problems a, b, c then Project Euler can provide info that solvers who have solved problems a, b, c went on to solve problems d, e, f. This way if you pick a problem at random, you will have some idea as to what problems you should have already solved to be able to solve this problem.