I'm looking for some planning algorithms that i can use to collect informations from sensor nodes in WSN. I found Dijkstra Algorithm but the problem with it is that it can't go through all the given nodes. I need 3 algorithms for my test.
Asked
Active
Viewed 59 times
1
-
This question is not complete. What are you looking for? What did you try? See: http://stackoverflow.com/help/how-to-ask – César Rodríguez Apr 21 '17 at 10:51
-
i'm looking for an algorithm that calculate the shortest path in a graph and it has to pass by ALL the nodes in this graph. – Mariam Belghzal Apr 22 '17 at 08:39
-
You are looking for [Hamiltonian path problem](https://en.wikipedia.org/wiki/Hamiltonian_path_problem) – César Rodríguez Apr 24 '17 at 07:44