php - Finding a path from any given node to another node -
i'm stuck on problem can't seem solve. problem:
i've got database contains table connections. example: node1 || node 2 || b || c b || d b || e e || h h|| e e|| b b || a
i know shortest path given node other node. want save nodes in path lets say: h or h or b etc.
this should done using, sql( info out of database) , php (to decide shortest path , homecoming answer).
try using djkstra method. possibile find dijkstra shortest path given node other node , node another
php search
No comments:
Post a Comment