12-08-2006, 02:30 PM
Well, I'll try to explain better. Look at this:
![[Image: graph4of.gif]](http://img57.imageshack.us/img57/237/graph4of.gif)
This is a simple graph. Graphs are made of vertexes(the dots) and edges(the lines). Mirage's map can be consider a graph, but a very specific graph becouse all vertex havefrom 2 to 4 edges(connections, and most of them have 4):
![[Image: untitleddq8.gif]](http://img231.imageshack.us/img231/3148/untitleddq8.gif)
We can say that a distance from vertex(1) and vertex(13) is 4, becouse that's the shortest path between them going thru other vertexes. For a human, to find this path is prety easy becouse this graph is veeery simple, and for a computer its even easier. You have a few algorithms to do that. I think that BFS(Breadth-first search) is the best on for our case, becouse an other thing tha make this graphs very unique is that the edges have all value 1, graph's edges can have any value, even
This is a simple graph. Graphs are made of vertexes(the dots) and edges(the lines). Mirage's map can be consider a graph, but a very specific graph becouse all vertex havefrom 2 to 4 edges(connections, and most of them have 4):
We can say that a distance from vertex(1) and vertex(13) is 4, becouse that's the shortest path between them going thru other vertexes. For a human, to find this path is prety easy becouse this graph is veeery simple, and for a computer its even easier. You have a few algorithms to do that. I think that BFS(Breadth-first search) is the best on for our case, becouse an other thing tha make this graphs very unique is that the edges have all value 1, graph's edges can have any value, even