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. 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
It's not really an answer to your question as such, but the JGraphT library (open source; not to be confused with the related and commercial JGraph counterpart) does a pretty good job of providing basic graph representations and algorithms. - JGraphT Home <http://www.jgrapht.org/> - JGraph Home <http://www.jgraph.com/> Randall Schulz --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
