[Tutor] Multiple Dimension (array/list/whatever it is are).
george at visp.com.au
Mon May 10 20:37:56 EDT 2004
On Mon, 10 May 2004 18:03:50 +0930
George Patterson <george at visp.com.au> wrote:
> Hi All.
> A could of quick questions:
snipped:- no longer relevant.
> For those that want the rest of the code see
Thanks to everyone that gave me some pointers.
A couple of people were confused as to why i wanted to set the value of several edges to the same value, well you can have a point that is equal distance from at least three points on a plane. Also what if the plane is not regularly spaced but virtual?
I am involved in a computer network project that uses OSPF which happens to use the same algorithm (Dijkstra's algorithm). The length of the edge translates into cost of sending data over that route.
Two main rules
1. Use the shortest path through the least number of vertexes or hops. This involves not routing a packet from one end of the network to the other. Hence keeping local traffic local, subject to rule two.
2. Don't send traffic through a possibly congested node. This involves setting the cost higher as the bandwidth is used and routing around the node. As you do so the congested node can clear the back log and you can go back to routing via that node.
I gotta say that this mail list is a great idea. No spoon feeding!! Give someone the directions on opening the tin and let them feed themselves. Works for me. :-D
More information about the Tutor