Due to the current gap in continued funding from the U.S. National Science Foundation (NSF), the NSF Unidata Program Center has temporarily paused most operations. See NSF Unidata Pause in Most Operations for details.
Due to the current gap in continued funding from the U.S. National Science Foundation (NSF), the NSF Unidata Program Center has temporarily paused most operations. See NSF Unidata Pause in Most Operations for details.
Oscar, > Have you chosen a graph data structure yet? I assume you will use some > kind of adjacency list representation to support sparse directed graphs, I am currently testing with hand-made *positional* data, and do not have an underlying graph structure yet. I feel that the underlying structure in any case will go thru a heavy adaption process to visad math and display types, so this is not a problem. > but I am curious if you have chosen the data types for the node and edge > labels, If you are talking about a visad MathType structure for them, no. I have tried out two today, but both had problems. If you have suggestions, let me know. > and if you will be using primitives or objects. What primitives and objects do you mean? Manuel
visad archives: