graphs

Manuel,

Have you chosen a graph data structure yet?  I assume you will use some
kind of adjacency list representation to support sparse directed graphs,
but I am curious if you have chosen the data types for the node and edge
labels, and if you will be using primitives or objects.

-- Oscar

***The contents of this email message are confidential and proprietary***


On Thu, 24 Jan 2002, Manuel wrote:

> > > For drawing graphs, I recommend using a UnionSet of
> > > Gridded2DSets with manifold dimension = 2. There is a
> > > simple example in visad/examples/Rivers.java.
> >
> > That should be a UnionSet of Gridded2DSets with
> > manifold dimension = 1.
>
> Bill, I have a question regarding this: The Rivers example uses one
> Gridded2DSet for each river - do you mean for the graph I should use one
> Gridded2DSet for each edge between two nodes?
>
> Thank you
>
> Manuel
>
>
>