[Top][All Lists]

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

[igraph] vertex.disjoint.paths and vertex.connectivity

From: Massimo Franceschet
Subject: [igraph] vertex.disjoint.paths and vertex.connectivity
Date: Thu, 15 Mar 2012 10:55:42 +0100

The R igraph help for vertex.connectivity claims that "The maximum number of 
vertex disjoint paths between two vertices is the same as their vertex 
connectivity". However, this is true only if the two vertices are not linked by 
an edge. Here is a short example:

> g = graph(c(0,1), dir=FALSE)
> g
Vertices: 2 
Edges: 1 
Directed: FALSE 
e [0] 0 -- 1

> vertex.connectivity(g, 0, 1)
Errore in vertex.connectivity(g, 0, 1) : 
  At flow.c:994 : vertices connected, Invalid value

> vertex.disjoint.paths(g, 0, 1)
[1] 1

reply via email to

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