KaleidoscopeIM / Optimized-Depth-First-Search

Exhaustive path finding between two locations/cities from a given graph using depth first method.
0 stars 0 forks source link

No alphanumeric DFS path found #1

Open eroglueray opened 4 years ago

eroglueray commented 4 years ago

When using my datasets output give a Tracing alternative 4 DFS path in total available combination: 46622222819885364931478750825563935804824469647799447002198282698755861978566258578145707374594196155909751199383996998609909376829655853895657735272910353983930457211399481303216376458347897987044140133934782299258649938299891926856037864087379628776884317537432345314884192474625461360397154599716359535004705391380440349531819180233482716793796437033107556967693649444027943868872591624968407367035084131941369085503142371961312405245931740721880232424415136010517778924950934389784576

My datasets here: cities : https://codeshare.io/cities roads: https://codeshare.io/roads Thanks