Related to : Single Source Shortest Path

Single Source Shortest Path 
25/12/2015 9:47 am by gorcorps in Programming Languages 

In the lecture we are taught that we can solve All Pairs
Shortest Path(APSP) with matrix
multiplication.
In APSP we are creating a distance table for all the distances
between each nodes in the graph. And now the question is "Is it
possible to solve
TAGS:
Single
Source
Shortest
Path

single source shortest path problem 
by billputer in Programming Languages 

Say in a map i need to find the shortest path between two cities A and
B. If i run a single source shortest path algorithm to solve it , it
will find the shortest path from vertex A to the all the other cities
in the World. So it will take a long time to come up with an answer.
So then single path s

What is the best singlesource shortest path algorithm for programming contests? 
by Baskaran in Programming Languages 

I was working on this graph problem from the UVa problem set. It's
a singlesourceshortestpaths problem with no negative edge weights.
From what I've gathered, the algorithm with the best bigO running
time for such problems is Dijkstra with a Fibonacci heap as the
priority queue, although prac

Why is the second CUDA kernel needed for computing the single source shortest path? 
24/11/2014 2:10 pm by Matt Brewer in Programming Languages 

I have implemented single source shortest path algorithm on CUDA by
referring to a research paper.
There are two kernels as follows
__global__ void SSSP_kernel_1(Node* d_node, int* d_edges,
int *d_weights, bool* d_mask, int* d_cost, int *d_costU, unsigned long
long no_of_nodes) {

shortest path single destination 
by Sweden in Programming Languages 

Hi, I am trying to code a version of liquid wars, but am getting
stuck on the algorithm used. It is a custom shortest path single
destination algorithm, but I dont quite understand it and wondered if
there was a better/faster one out there. Imagine I have a 10x10
array and I want to

Single destination shortest path 
by showb1z in Programming Languages 

hi..i ve been familiar with single source shortest
path...dijkstra's... wat if i want to solve single destination
shortest path.... can i modify the approach of single source
dijkstra's to find this.... plz let me know... thanks

Shortest path calculation from source to destination 
30/11/2014 9:20 am by Thomas Gueze in Programming Languages 

I am trying to implement BFS in graph, found the following code and
wondering how to include distance to each vertex using this below
implementation.
My idea is to calculate the shortest distance for unweighted
graph....
Here is the code I am following:
#include<

How to optimize Dijkstra algorithm for a single shortest path between 2 nodes? 
by Max Ollerenshaw in Programming Languages 

I was trying to understand this implementation in C of the Dijkstra
algorithm and at the same time modify it so that only the shortest
path between 2 specific nodes (source and destination) is
found.
However, I don't know exactly what do to. The way I
see it, there's nothing much to d

Single shortest path of an acyclic undirected disconnected graph 
by xetrill in Programming Languages 

Is there a graph algorithm that given a start(v) and an end(u) will
find a shortest path through the given set of edges, but if u is a
disconnected vertex, it will also determine the shortest path to add
missing edges until u is no longer disconnected?
I have a
pixel matrix where line

How to compute single source shortest paths with OSRM? 
by Martin Dobrev in Programming Languages 

I've been playing around with the OSRM routing library recently. It
seems to be highly efficient at solving the shortest path problem.
However, I didn't see how to compute single source shortest paths with
it. More precisely, given a fixed starting point, compute the shortest
distances to all loc
