[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [igraph] all paths between nodes

From: Andrew Edelman
Subject: Re: [igraph] all paths between nodes
Date: Thu, 21 Oct 2010 08:21:21 -0600
User-agent: Mozilla/5.0 (Windows; U; Windows NT 6.1; en-US; rv: Gecko/20101013 Lightning/1.0b2 Thunderbird/3.1.5

For R users, the package sna has the function kpath.census, which enumerates all paths on a graph (even ones with cycles). if the dyadic.tabulation element is included in the function, then the resulting output matrices of pathway counts are organized by dyad.


On 10/21/2010 3:26 AM, Tamas Nepusz wrote:
if g is a graph tha has nodes i and j,

how do i find *all the paths" between nodes i and j?
A Python solution has just been mentioned in one of the emails yesterday:


Probably you can come up with something similar for R if you happen to use the 
R interface instead.

reply via email to

[Prev in Thread] Current Thread [Next in Thread]