On Oct 30, 11:01 am, "Matthew D. Swank" <[EMAIL PROTECTED]>
wrote:
> On Oct 30, 8:57 am, Rich Hickey <[EMAIL PROTECTED]> wrote:
>
>
>
> > On Oct 29, 6:27 pm, ccahoon <[EMAIL PROTECTED]> wrote:
>
> > > Hello,
>
> > > I'm wondering what would be a good way to represent a mincut, maximum
> > > flow
On Oct 30, 8:57 am, Rich Hickey <[EMAIL PROTECTED]> wrote:
> On Oct 29, 6:27 pm, ccahoon <[EMAIL PROTECTED]> wrote:
>
> > Hello,
>
> > I'm wondering what would be a good way to represent a mincut, maximum
> > flow problem in Clojure. A set of weighted edges makes sense to me,
> > but I am not sure
Hey Chris,
You might want to look at Jung Graphing ( http://jung.sourceforge.net/) for
inspiration or reuse. v1.7.6 interoperates well and provides a functional
style interface. The only gotcha is nested interface referencing, which
requires package.class$nested class referencing. Clojure and
On Oct 29, 6:27 pm, ccahoon <[EMAIL PROTECTED]> wrote:
> Hello,
>
> I'm wondering what would be a good way to represent a mincut, maximum
> flow problem in Clojure. A set of weighted edges makes sense to me,
> but I am not sure how best to represent the edges so I can use them as
> a key in a ma
On Wednesday 29 October 2008 15:27, ccahoon wrote:
> Hello,
>
> I'm wondering what would be a good way to represent a mincut, maximum
> flow problem in Clojure. A set of weighted edges makes sense to me,
> but I am not sure how best to represent the edges so I can use them
> as a key in a map. Par
