[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[igraph] Finding paths
|
From: |
Moses Boudourides |
|
Subject: |
[igraph] Finding paths |
|
Date: |
Mon, 16 May 2011 09:58:49 +0200 |
Hi,
This might be easy but I would appreciate your support. Having the
adjacency matrix of a graph, how could I find the paths (NOT walks)
between any two nodes? Actually, for each pair of nodes, I'd like to
have all possible lengths of the existing paths joining them.
Best,
--Moses
- [igraph] Finding paths,
Moses Boudourides <=