I wonder if you have a source and a target vertice and that I want to find the shortest path between them. My question is it doesn't exist a path between source and target vertrice what will happen then in Djikstras Algorithm will this algorithm discover it?
Djikstras Algorithm if it doesn't exist a path
567 Views Asked by Jonas Bo At
1
There are 1 best solutions below
Related Questions in SHORTEST-PATH
- Algorithm for finding a subset of nodes in a weighted connected graph such that the distance between any pair nodes are under a postive number?
- shortest path algorithm with expected cost
- Scalable Python Shortest Path on Large DAG with Multiple Walkers
- Simplify 2D map to optimize pathfinding
- undirected graph - Shortest path with Vertex and edges Weight
- Why am I getting different length and travel time from OSMnx or networkx when comparing it with Google Maps?
- Simplification of O((V + E) logV) time complexity
- Dijkstra for negative weighted cycles- Add a very large number, make all edges positive
- Condition for loop in Floyd–Warshall algorithm
- Modification of Dijkstra's algorithm to make it work with negative weights and its time complexity
- Shortest path finding for multiple points in 2d ware house
- Find next node from source on the path to given node in a graph
- An algorithm to find the shortest path based on 2 criteria
- does the rule : 'kth iteration relaxes all nodes that are atmost k edges from source' work for all graphs?
- Solving Shortest Path Problem with Message Passing GNN
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
Popular # Hahtags
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
The algorithm will eventually run out of possible paths to check, determining that it is not possible: the distance to the target vertice would still be infinity, as it was initialized.
Not necessarily the best way to determine this, though.