Account Options

  1. Sign in
The old Google Groups will be going away soon, but your browser is incompatible with the new version.
Google Groups Home
« Groups Home
Message from discussion Using dijkstra for top N paths
The group you are posting to is a Usenet group. Messages posted to this group will make your email address visible to anyone on the Internet.
Your reply message has not been sent.
Your post was successful
 
From:
To:
Cc:
Followup To:
Add Cc | Add Followup-to | Edit Subject
Subject:
Validation:
For verification purposes please type the characters you see in the picture below or the numbers you hear by clicking the accessibility icon. Listen and type the numbers you hear
 
Yuval  
View profile  
 More options Oct 3 2012, 3:50 am
From: Yuval <yuvalper...@gmail.com>
Date: Wed, 3 Oct 2012 00:50:38 -0700 (PDT)
Local: Wed, Oct 3 2012 3:50 am
Subject: Re: [Neo4j] Using dijkstra for top N paths

Do you have any idea who might be my friend?

The end result should be something similar to navigation apps where they
show you several suggested routes.

On Wednesday, October 3, 2012 9:24:17 AM UTC+2, Lasse Westh-Nielsen wrote:

> On Wed, Oct 3, 2012 at 12:20 AM, Yuval Perlov <yuval...@gmail.com<javascript:>>
> wrote:
> > Seems the idea is to traverse all possible paths... what if there are a
> lot
> > of paths?  Dijkstra allows to find the best route but not the second
> third
> > etc but all might be too complex.

> Finding the shortest path involves looking at a lot of paths - think
> about it, if you didn't, the shortest might be one of the ones you
> didn't look at. It is the nature of the problem :)

> Dijkstra in particular will find shortest paths to all reachable nodes
> using some fixed starting point. Did you need multiple paths between
> two fixed points instead? Then Dijkstra is not your friend.

>  - Lasse


 
You must Sign in before you can post messages.
To post a message you must first join this group.
Please update your nickname on the subscription settings page before posting.
You do not have the permission required to post.