library(graph_algorithms)

From: Marc van Dongen <dongen_at_cs.ucc.ie>
Date: Mon 10 Nov 2003 04:30:16 PM GMT
Message-ID: <20031110163016.GA28007@cs.ucc.ie> 
Dear all,



Is there anybody who has implemented (and is willing to share) predicates
for incrementally constructing/destructing graphs that are compatible with
the ones in the library graph_algorithms? The kind of operations that I'm
looking for are for adding/removing nodes/arcs. I Know I can do this by
transforming to lists of edges, modifying the edges and reconstructing the
graph from scrathc but I was hoping for something a bit better:-)


Regards,


Marc van Dongen
-- 
M.R.C. van Dongen | CS Dept University College Cork    |        ()
 dongen@cs.ucc.ie | Cork Constraint Computation Centre |        /\
+353(0)21 4903578 | Western Road                       |   ASCII ribbon
                  | Cork, Ireland                      | against html mail
Received on Mon Nov 10 16:55:19 2003

This archive was generated by hypermail 2.1.8 : Wed 16 Nov 2005 06:07:26 PM GMT GMT