[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [igraph] shortest path in graph with weights
|
From: |
Gábor Csárdi |
|
Subject: |
Re: [igraph] shortest path in graph with weights |
|
Date: |
Wed, 29 Apr 2009 14:26:03 +0200 |
On Wed, Apr 29, 2009 at 2:14 PM, Romildo Martins
<address@hidden> wrote:
> Hello,
>
> You can choose the shortest path in a undirected graph with weights so that
> if an edge is the maximum capacity, the algorithm discard any path with this
> edge.
Hi,
why don't you just remove that edge? Or remove the paths containing that edge?
Gabor
> Thanks,
>
> Romildo
>
> _______________________________________________
> igraph-help mailing list
> address@hidden
> http://lists.nongnu.org/mailman/listinfo/igraph-help
>
>
--
Gabor Csardi <address@hidden> UNIL DGM