java - Find all possible path from source to destination in udirected graph -


i making android bus app ,in have find possible path between source , destination. using dijkstra algorithm dfs search.

but when entered source , destination finding result ,it takeing more time , app crash.

please provide solution ..

i think crashing as, believe, algorithm using finding path 1 such path exists. kruskals algorithm can find multiple paths.

https://github.com/monmohan/mgraphlib

may help


Comments

Popular posts from this blog

c# - How to get the current UAC mode -

postgresql - Lazarus + Postgres: incomplete startup packet -

javascript - Ajax jqXHR.status==0 fix error -