Questions tagged [shortest-path]
Questions about the algorithmic problems of finding shortest paths between nodes in a graph.
1
vote
1answer
31 views
calculating a shortest path in a table structure that changes in real time
I have a table that looks like this
In table NPC - are AI like characters that move from one point to another. Player - a character that is controlled by the user.
In any moment the player ...
1
vote
0answers
30 views
Given complete graph, find optimal path with two costs on each edge
We are given complete graph, such that each edge has two costs $a \text{ and } b$. We should find path that passes through each node once and has minimum total cost. Cost of a path is the maximum of ...
1
vote
1answer
29 views
Shortest path in a incomplete graph
I know the Dijkstra algorithm to solve the "single source shortest path" problem in a graph. And I've seen people discuss solutions in a dynamic graph where edge/vertices are subject to change. ...
-1
votes
0answers
18 views
Best way for brute force search of all possible paths in Sparse Matrix
I am listing all possible paths from a biograph object with 67 nodes and 166 edges. The exchange Matlab function that I am using which lists all possible paths hang after 50 nodes. Any suggestion on ...
0
votes
0answers
21 views
Single source shortest paths with even path [duplicate]
Given directed graph with non negative weights and vertex s.
I need an algorithm that finds shortest paths from s to all vertices and the paths have to be even.
2
votes
1answer
114 views
Proof that shortest path with negative cycles is NP hard
I'm looking into the shortest path problem and am wondering how to prove that shortest path with neg. cycles is NP-hard. (Or is it NPC? Is there a way to validate in P time that the path really is ...
1
vote
0answers
14 views
Can the shortest path problem be solved using Monte Carlo Tree Search?
I think Monte Carlo Tree Search could be used to find the shortest path, but it seems that this method is only used considering win/lose outcomes in the simulation step.
If we consider the path ...
0
votes
0answers
64 views
Shortest path for vehicle routing problem with alternative locations
I'm currently developing an algorithm that solves the vehicle routing problem with time windows and the possibility for clients to be delivered to multiple locations.
Right now, I'm trying to find ...
2
votes
3answers
51 views
Shortest path between any origin to any destination through some way stations
How can one find the shortest path between any one of the origins to any one of the destinations through a number of way stations on the way using Dijkstra algorithm?
You can visit those way stations ...
0
votes
1answer
33 views
Confused in calculating the shortest-path using Dijkstra's Algorithm [closed]
I am required to find the shortest path using Dijkstra's Algorithm. After performing the calculations, am I getting the following values correct?:
...
1
vote
2answers
72 views
Shortest path with a given condition
The problem says to find the shortest way (the smallest amount of intermediary points), with given source and destination points, such that between two consecutive intermediary points there are two ...
1
vote
1answer
43 views
Minimum distance of nodes from a set of two nodes
In an unweighted tree, suppose that we want to delete (or mark) any node which is closer to node $v$ than node $w$ ($dist(x,v) < dist(x,w)$). The solution that comes to my mind is running two BFS, ...
0
votes
1answer
21 views
Using the decision problem, PATH in order to solve the optimization problem, SHORTEST-PATH in polynomial time
So, if I were using a black-box decision algorithm, PATH in which I could say, "does a path of weight k exist in this graph from ...
1
vote
1answer
85 views
Shortest Path in Layerwise Complete Graph
Consider a directed $k$ partite graph $G$ with a source node $s$ and a sink node $t$. Each vertex in the graph is labeled with a positive integer value. Both the source and sink are labeled with $0$. ...
2
votes
1answer
44 views
Bellman-Ford - is number of interations greater than diameter?
Diameter of a connected, undirected graph is the smallest natural
number d, so that between any two vertices of the graph exist path
of length at most d.
Prove or disprove: in Bellman-Ford is ...
1
vote
1answer
41 views
Is the number of shortest paths between every two vertices at most 4*n^3?
In every weighted graph with $n$-vertices
with negative weights,
with $n > 10$,
a weight can't appear $n$-times in graph,
there are between every two vertices at most $4n^3$ shortest paths.
I'm ...
0
votes
0answers
28 views
Finding negative cycle using Bellman Ford
Given a graph with |V| vertexes and |E| edges, I have to find a negative cycle, if there is one, in a graph.
The wanted complexity is O(|V|*|E|).
I was thinking about using Bellman-Ford to solve the ...
3
votes
2answers
74 views
Single-source shortest paths with even weight
I need help to find an algorithm that calculates the single-source shortest paths in a graph, with an extra condition that the weight of the path has to be even.
In another words, we have to find the ...
2
votes
1answer
42 views
shortest path tree algorithm
Suppose we are given a directed weighted graph $G=(V,E)$, a source vertex $s$ and the value of the cheapest path $\delta(s,v)$ for every $v \in V$.
I want to find an algorithm for the shortest path ...
4
votes
1answer
99 views
Path between two vertices in directed graph without cyclic vertices
I have been searching online for some time but I have not found an answer.
Is there a polynomial time algorithm to find a path in directed graph between two vertices so that within the path no cyclic ...
11
votes
3answers
1k views
What is the meaning of 'breadth' in breadth first search?
I was learning about breadth first search and a question came in my mind that why BFS is called so. In the book Introduction to Algorithms by CLRS, I read the following reason for this:
Breadth-...
0
votes
0answers
15 views
Implementation of multiple sink shortest pair of disjoint paths problem for multigraphs
I would like to implement the shortest pairs of edge-disjoint paths of Suurballe and Tarjan for multigraphs in the interpretation of Banerjee et al. (http://web.cs.iastate.edu/~pavan/papers/short.pdf, ...
1
vote
1answer
153 views
Djikstra's algorithm to compute shortest paths using at least k edges
I have a graph G = (V, E) where each edge is bidirectional with positive weight. I want to find the shortest path from vertex s ...
1
vote
1answer
91 views
Multiple Source Shortest Paths in a weighted graph
In an unweighted graph, we can find Multiple Source Shortest Paths using the Breadth-First Search algorithm by setting the distance of all starting vertices to zero and pushing them into the queue at ...
0
votes
1answer
49 views
Minimal paths as solution of a linear program of a special network flow
Let $G= (V,E)$ be a given directed weighted graph, and $s,t$ two specified nodes, so that there is no negative cycle reachable from $s$, and $t$ is reachable from $s$.
We're looking for the shortest ...
0
votes
0answers
96 views
How can an A* algorithm visit all nodes?
Is it possible to find the shortest path and visit all the nodes in a graph by A* algorithm? If yes, how?
2
votes
1answer
108 views
Given directed connected weighted graph, check if d(v) = delta(s,v)
I'm having some hard time with this problem.
Can someone give me some clue/guidance?
This is an homework question, so please don't just solve it.
Given a weighted directed connected graph $G = (V,...
1
vote
1answer
132 views
Dijkstra’s versus Lowest-cost-first (best first), resolving some contradictions regarding complexity analysis
Our professor took three statements from various textbooks that seem to be a little contradictory regarding the complexity analysis of Dijkstra’s algorithm as well as the lowest-cost-first or best ...
4
votes
0answers
81 views
Can the running time be reduced to something lower than $O(d^4)$?
Imagine I have a weighted complete directed graph $G$ with $d$ vertices(so $d(d-1)$ edges) and I want to do the following:
Set $D$ to be a DAG with the same set of vertices but without any edges
sort ...
0
votes
1answer
17 views
Term for an A*-like pathfinding strategy where only the heuristic goal distance matters
I am trying to find a proper term for the A*-like best-first pathfinding strategy where the node to expand next is the one with the least estimated distance from the goal, regardless of its distance ...
0
votes
1answer
44 views
Hitting probability of random walk within given number of steps
Given m,n dimensions of a 2D matrix; (i,j) initial co-ordinates; (x,y) final co-ordinates.
What is the probability of being at (x,y) after at most k steps if we start from (i,j) initially?
We can ...
1
vote
1answer
160 views
Floyd–Warshall algorithm on an undirected graph contains negative weight edges
According to this answer, the Bellman-Ford algorithm doesn't work when an undirected graph contains negative weight edges since any edge with negative weight forms a negative cycle, and the distances ...
6
votes
1answer
137 views
Finding a negative cycle in a bipartite graph
The Bellman-Ford algorithm can be used to find a negative cycle in a general graph, in time $O(|V||E|)$. Is there a faster algorithm for finding a negative cycle in a bipartite directed graph, where ...
0
votes
1answer
53 views
Distance function such that we visit every “color region” once [closed]
Consider the following image:
Starting at (0,0) top left, the objective is to find a dijikistra path to the bottom right.
We must go through each color exactly once, and once we go outside a color, ...
3
votes
1answer
106 views
Constructing a minimum spanning tree from an all-shortest path graph?
Given an $n \times n$ shortest path distance matrix $D$. And a complete graph $G(D)$ on $n$ nodes, where edge $(i, j)$ has weight $D_{ij}$. Furthermore, the distance matrix $D$ is computed for a ...
1
vote
1answer
56 views
Combinatorial Optimization: Shortest distance given sets of drivers and riders
Problem:
I have 2 sets, one of drivers and one of riders. All my participants need to reach one common destination. I wish to calculate the shortest combined distance in order for all participant to ...
2
votes
2answers
92 views
Given all pairs shortest paths matrix, find graph with minimum total sum of edges
I was looking at some problems about graphs, and I got stuck on this one. Namely, we have given matrix of size $N \cdot N$ representing the length of the shortest path in undirected graph between some ...
3
votes
2answers
195 views
How many iterations does the Bellman-Ford algorithm need for directed and undirected graphs
The Bellman-Ford algorithm on a graph with $n$ vertices, normally includes a loop executed $n-1$ times. Each time through the loop we iterate over the list of edges $(u,v)$ and relax $v$. Note that ...
2
votes
1answer
44 views
All pair shortest path in a tripartite graph
I have a tri-partite graph with three sets of vertices source, bridge and destination nodes. I want to find the shortest path between every vertex in the source set to every vertex in the destination ...
3
votes
1answer
27 views
Longest simple walk below a certain weight
Given a directed graph G and a starting vertex $v$ and a cutoff weight $w$, I want to find a simple walk with net weight < $w$ that visits as many nodes as possible. Currently, I have a recursive ...
0
votes
1answer
49 views
Running Dijkstra on particular graph with negative weight
After running Dijkstra on this graph from S, which shortest paths will be incorrect?
This graph has a negative weight, so which shortest paths will be incorrect? after my first attempt I got that Y ...
0
votes
1answer
178 views
Dijkstra complexity analysis using adjacency list and priority queue?
I just got to look at the Implementation of Dijkstra using adjacency list and priority queue. The time complexity is $O(E\log V +V)$, I tried looking for the proof but couldn't find one. Any help will ...
0
votes
0answers
33 views
Contraction Hierarchies minimal distance proof
I am trying to implement "Contraction Hierarchies" algorithm and reading the white paper and watching video lectures [6,7]. But still I can't understand proof for the following lemma:
Lemma 1. $d(s,...
1
vote
1answer
109 views
Shortest path from source to all vertices, but with some wildcards
Here is problem in Sprinklr Interview Experience | Set 5 (On campus – FTE for Product Engineer).
You are given a graph of $n$ nodes with $m$ bidirectional edges. Each edge has some value associated ...
0
votes
0answers
101 views
Successive shortest path without reduced costs
The successive shortest path algorithm, used to solve the minimum-cost flow problem, can be described as follows :
Successive shortest path (for minimum-cost flow) :
while all flow is not ...
2
votes
1answer
49 views
Djikstra algorithm analysis
My textbook says that the Dijkstra algorithm's runtime is $O(n) + O(m \log(n)) = O((n+m) \log(n))$. How did they come up with that?
Dijkstra algorithm pseudocode:
...
1
vote
1answer
28 views
How is Johnson's shortest path weighting function $\hat{w}(u, v) = w(u, v) + h(u) - h(v)$ proven by the triangular inequility?
Recap to the Johnson's shortest path algorithm:
By the procedure extending the original graph $G^\prime = (V^\prime, E^\prime), V^\prime = V\ \cup \{s\}, E^\prime = E\ \cup \{(s, v)\ |\ \forall v \in ...
0
votes
2answers
258 views
Understanding connection between minimum spanning tree, shortest path, breadth first and depth first traversal
In CLRS, in the later part of breadth first search topic, for unweighted graphs, it says:
At the beginning of this section, we claimed that breadth-first search finds the distance to each reachable ...
0
votes
0answers
57 views
Finding all edges on any shortest path between two nodes using dijkstra
Given a directed weighted graph, we need to mark all edges (represented by an ordered triple of (source,destination,weight) ) which lie on some shortest path from source to destination (there could be ...
3
votes
1answer
84 views
Intersection of two shortest paths in connected weighted graph
Let $G=(V,E)$ be a connected directed weighted graph with non-negative weights
on edges. Let $u,v,s,t$ be vertices in the graph $G$. I need to find an algorithm which in $O(|E|\log |V|)$ time checks ...
