Persistant graphs

projectshave_at_yahoo.com
Date: 10/05/04

  • Next message: Bill Spight: "Re: Persistant graphs"
    Date: 5 Oct 2004 14:44:56 -0700
    
    

    I'd like to do some graph rewriting in Prolog, which will involve lots
    of addition/deletion of nodes and edges. If a rewrite "fails", it must
    backtrack to the original graph and attempt a different rewrite. A
    persistant, or functional, graph would work best in this case. Is
    there a library for persistant graphs available for Prolog somewhere?
    I'm hoping to avoid the assert/retract global space.

    I didn't find any pointers in a google search of this group. Has
    anyone attempted to implement Martin Erwig's paper "Inductive Graphs
    and Functional Graph Algorithms". Otherwise, maybe some kind soul has
    ported the Mercury graph library to ISO Prolog and would be willing to
    post it.

    Thanks.


  • Next message: Bill Spight: "Re: Persistant graphs"

    Relevant Pages

    • Re: Three quesition about graph coloring
      ... so I rewrite the first article. ... X:= chromatic number of simple graph G ... Is always exist simple graph F s.t. CLRS=CLRSvSv CLRS? ...
      (sci.math)
    • Re: Three quesition about graph coloring
      ... I cannot use some special symbol here ... so I rewrite the first article. ... X:= chromatic number of simple graph G ...
      (sci.math)
    • Re: Persistant graphs
      ... >> I'd like to do some graph rewriting in Prolog, ... >> backtrack to the original graph and attempt a different rewrite. ... > along with their immediate successors. ...
      (comp.lang.prolog)
    • Re: Floyd warshall
      ... Since this questions is suspiciously similar to someone asking for a homework: ... Do you know enough Prolog so you can represent the graph in Prolog terms? ...
      (comp.lang.prolog)
    • Re: Persistant graphs
      ... > I'd like to do some graph rewriting in Prolog, ... > backtrack to the original graph and attempt a different rewrite. ... may take a lot of memory, but memory is cheap these days. ...
      (comp.lang.prolog)