Re: [jgrapht-users] Graph Partitioning

[Ball, N. S <nic...@im...>]

Nope, unfortunately that's not what I was looking for.

I need a way to partition a complete weighted graph into two parts (not necessarily equal) in the best way so that to minimize the weights that cross between the two partitions. AKA: Graph bisection problem or Graph partitioning problem.

Not sure if you support such a thing as it is quite computationally intensive and not easy development!
There are a number of approximation solutions but none have been implemented in Java :(

Nicholas

________________________________________
From: John Sichi [js...@gm...]
Sent: 03 June 2011 00:01
To: Ball, Nicholas S
Cc: jgr...@li...
Subject: Re: [jgrapht-users] Graph Partitioning

Your requirements aren't clear, but if you mean you'd like to apply a
weight threshold to decide whether an edge should count as a
connection or not, then just create a subgraph view which filters the
edges based on weight, and then run ConnectivityInspector on that.

JVS

On Thu, Jun 2, 2011 at 11:17 AM, Ball, Nicholas S
<nic...@im...> wrote:
> Hello all,
> I see you have a way of generating Bipartite Graphs but do you have anything
> implemented that will split a graph into two graphs/sets based on the
> weighted values on the edges.
> If not, any idea where I can find a java implementation of this!? Been
> looking everywhere!
> Thank you and keep up the good work!
> Nicholas
>
> ------------------------------------------------------------------------------
> Simplify data backup and recovery for your virtual environment with vRanger.
> Installation's a snap, and flexible recovery options mean your data is safe,
> secure and there when you need it. Discover what all the cheering's about.
> Get your free trial download today.
> http://p.sf.net/sfu/quest-dev2dev2
> _______________________________________________
> jgrapht-users mailing list
> jgr...@li...
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
>
>