?

Log in

No account? Create an account
entries friends calendar profile Previous Previous Next Next
shadows of echoes of memories of songs
j4
j4
Oxbridges of Konigsberg
Read 35 | Write
Comments
caramel_betty From: caramel_betty Date: February 11th, 2009 07:29 pm (UTC) (Link)
A graph is something like this:

http://en.wikipedia.org/wiki/File:6n-graf.svg

So there's a road (edge) from college 6 to college 4, and a road from college 4 to college 5. There's no direct road between 3 and 5, but you can get there going indirectly. A weighted graph is that, with the distance between each college provided as a weight.

So what you're being asked for is basically: "Can you draw me a map with all the allowable cycle routes on, and the distance of each bit?"

Edited at 2009-02-11 07:30 pm (UTC)
katstevens From: katstevens Date: February 11th, 2009 08:17 pm (UTC) (Link)
Beaten to it! That'll teach me to directly reply via email :)
Read 35 | Write