Develop two different implementations of Snake model by using a Greedy algorthm and an Gradient Descent method. Compare results. Put all details and results in your report.

A PhD thesis by Peter Mahlmann. Devoted to design and implementation of P2P networks, based on random graphs. It creates a low-latency model for a P2P network, based on random graph theory. Contains links to a Java implementation of the prototype.