2 Apr
2010
2 Apr
'10
9:40 p.m.
I have some ideas about implementing graph connectives. I think that the best way to implement first four binary operations (union, join, intersection and difference) is to use adjacency matrices.
I think variants of these algorithms for non-adjacency matrices are just as important. It would be best to focus on these problems and their generic solution than to propose more solutions for a smaller set of graphs. Andrew Sutton andrew.n.sutton@gmail.com