Persistant graphs
projectshave_at_yahoo.com
Date: 10/05/04
- Previous message: Robert Oschler: "Re: WordNet 2.0 data files in MySQL format available for download"
- Next in thread: Bill Spight: "Re: Persistant graphs"
- Reply: Bill Spight: "Re: Persistant graphs"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
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.
- Previous message: Robert Oschler: "Re: WordNet 2.0 data files in MySQL format available for download"
- Next in thread: Bill Spight: "Re: Persistant graphs"
- Reply: Bill Spight: "Re: Persistant graphs"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Relevant Pages
|
|