I want an API that is optimized around tree traversal and replacement. Clojure.walk and zippers can be pretty great, as of course the associative aspect of maps and vectors.
Going from a tree of maps and vectors to a graph representation makes things harder and less direct. Theres some challenges about providing such an abstraction, was just wondering if anyones thought about this. On Thu, Apr 30, 2015 at 1:37 PM, Mark Engelberg <mark.engelb...@gmail.com> wrote: > Ubergraph can certainly represent DAGs, since DAGs are just a special case > of directed graphs. There is also the function ubergraph.alg/dag? to test > whether a graph is a DAG. There are included algorithms, such as > topological sorting, which only work on a DAG, and other functions, such as > shortest-path which will work just as well on a DAG. > > So what sorts of functionality would you be looking for in a DAG-only > library? > > > On Thu, Apr 30, 2015 at 6:21 AM, kovas boguta <kovas.bog...@gmail.com> > wrote: > >> Very cool! >> >> On a related note: I would be interested in a similar library focused on >> DAG's. Any thoughts there? >> >> >> >> >> >> >> On Wed, Apr 29, 2015 at 10:00 PM, Mark Engelberg < >> mark.engelb...@gmail.com> wrote: >> >>> https://github.com/Engelberg/ubergraph >>> >>> Ubergraph is a versatile, general-purpose graph data structure for >>> Clojure. It is designed to complement and extend Loom, a popular Clojure >>> collection of graph protocols and algorithms. >>> >>> Ubergraph implements all of Loom's protocols and draws them together in >>> one namespace, making it a one-stop, batteries-included graph >>> implementation. But more importantly, Ubergraph goes beyond Loom's >>> protocols, allowing a mixture of directed and undirected edges within a >>> single graph, multiple "parallel" edges between a given pair of nodes (aka >>> multigraphs), multiple weight attributes per edge, and changeable weights. >>> >>> The ubergraph.alg namespace contains an assortment of algorithms >>> compatible with graphs, digraphs, multigraphs, and multidigraphs (and >>> backwards-compatible with Loom graphs). A highlight of the ubergraph.alg >>> namespace is its feature-rich shortest-paths algorithm, which supports a >>> number of useful search options: edge filters, node filters, goal >>> predicates, multiple starting nodes, multiple ending nodes, using any >>> attribute or function as the cost for an edge, and more. >>> >>> -- >>> 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 >>> Note that posts from new members are moderated - please be patient with >>> your first post. >>> To unsubscribe from this group, send email to >>> clojure+unsubscr...@googlegroups.com >>> For more options, visit this group at >>> http://groups.google.com/group/clojure?hl=en >>> --- >>> You received this message because you are subscribed to the Google >>> Groups "Clojure" group. >>> To unsubscribe from this group and stop receiving emails from it, send >>> an email to clojure+unsubscr...@googlegroups.com. >>> For more options, visit https://groups.google.com/d/optout. >>> >> >> -- >> 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 >> Note that posts from new members are moderated - please be patient with >> your first post. >> To unsubscribe from this group, send email to >> clojure+unsubscr...@googlegroups.com >> For more options, visit this group at >> http://groups.google.com/group/clojure?hl=en >> --- >> You received this message because you are subscribed to the Google Groups >> "Clojure" group. >> To unsubscribe from this group and stop receiving emails from it, send an >> email to clojure+unsubscr...@googlegroups.com. >> For more options, visit https://groups.google.com/d/optout. >> > > -- > 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 > Note that posts from new members are moderated - please be patient with > your first post. > To unsubscribe from this group, send email to > clojure+unsubscr...@googlegroups.com > For more options, visit this group at > http://groups.google.com/group/clojure?hl=en > --- > You received this message because you are subscribed to the Google Groups > "Clojure" group. > To unsubscribe from this group and stop receiving emails from it, send an > email to clojure+unsubscr...@googlegroups.com. > For more options, visit https://groups.google.com/d/optout. > -- 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 Note that posts from new members are moderated - please be patient with your first post. To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en --- You received this message because you are subscribed to the Google Groups "Clojure" group. To unsubscribe from this group and stop receiving emails from it, send an email to clojure+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.
