[R-sig-Geo] Shortest network path distances

[Dan Bebber]

Dear Virgilio,

Try the minCut() and edgeConnectivity() functions in RBGL.
You may need to adapt them to your problem.

Dan

-----Original Message-----
From: Virgilio Gomez-Rubio [mailto:v.gomezrubio at imperial.ac.uk] 
Sent: 14 September 2007 12:14
To: danbebber at forestecology.co.uk
Cc: R-sig-geo
Subject: Re: [R-sig-Geo] Shortest network path distances

Dear Dan,


> Anything is possible on R!
> I do all my shortest path calculations with RBGL and graph packages 
> from Bioconductor.

I am working on something that requires finding the minimum set of nodes to
split a graph in n components and I am wondering whether there is something
on CRAN or Bioconductor to make that. Basically, I would like, for example,
get the minimum number of (adjacent) nodes that split the graph in two
components. Is it possible to do that with R?

Best regards,

Virgilio