[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [igraph] Shortpath with maximum height
|
From: |
Tamas Nepusz |
|
Subject: |
Re: [igraph] Shortpath with maximum height |
|
Date: |
Mon, 29 Mar 2010 23:30:05 +0200 |
Hi,
> I would like to know how to function shortestpath choose paths with only
> edges with weight less than x (dinamic value).
Make a copy of the graph, delete all the edges that have weight larger than x
and run the shortest path calculation on the modified graph.
--
Tamas