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 Jung were a great combo for graph oriented applications. Jung provides some great out of the box algorithms for graph analysis and pluggable "functional style" interface.
Roger On 10/29/08 5: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 map. Pardon me for asking such a noob question on this > board. I am new to graph representations. > > For example, if I have an edge (p, q) with weight 2, what is a good > way to represent that so I can access weights with the edges? > > Thanks for any help. > > Chris > > > --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/clojure?hl=en -~----------~----~----~----~------~----~------~--~---
