[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [igraph] Neighbor vertices List
From: |
Gábor Csárdi |
Subject: |
Re: [igraph] Neighbor vertices List |
Date: |
Tue, 29 Sep 2009 08:42:56 +0200 |
I think what you are looking for is probably the get.shortest.paths()
or the get.all.shortest.paths() functions.
Best,
Gabor
On Tue, Sep 29, 2009 at 12:12 AM, Surendar Swaminathan
<address@hidden> wrote:
> Is there a way I can list the nodes traversed from one node to the
> other nodes.
>
> Give a graph object. If I have a source node and Target node can I
> find a way to list all the nodes to reach from source node to target
> node.
>
>
> Example
>
> Node vv1 Node v2
>
> 1 2
> 2 3
> 3 4
>
> when Input node 1,node 4 I want the output to list 2,3.
>
>
> Thank you very much for the help,
>
> surendar
>
>
> _______________________________________________
> igraph-help mailing list
> address@hidden
> http://lists.nongnu.org/mailman/listinfo/igraph-help
>
--
Gabor Csardi <address@hidden> UNIL DGM