can anyone suggest me a way of doing this?
lets say we have a file input.in
in the file we have two words each has from 1 to 10 chars
for example
input.in
quote
Type: Posts; User: johnsonswww
can anyone suggest me a way of doing this?
lets say we have a file input.in
in the file we have two words each has from 1 to 10 chars
for example
input.in
quote
hm
Lets suppose we know that when we go from 0(0,0) to M(A,B) we go from smallest X to bigger ones, but when we return from M to 0 we go from biggest X to smaller ones? Could we then solve it...
@ MK27 thats why im not looking the brute force method, it will take ages if the nodes would be for example 10000 or something
im looking the other way,dynamic programming.
i dont want to find the shortest distance between A,B but the shortest distance between 0(0,0) and M(A,B) which have some other nodes between them.
So what i want to do is find the shortest...
Ok i ve read so much stuff about shortest path algorithms but i cant solve this problem.
Lets say we have a node 0(0,0) and another node M(A,B)
We also have other nodes between them all are...