Sponsored Content
Full Discussion: Graph in java
Top Forums Programming Graph in java Post 302711235 by DGPickett on Friday 5th of October 2012 02:38:40 PM
Old 10-05-2012
A class for nodes ( coordinates, a (stock) collection of line references ) and a class for lines ( 2 end node references and maybe cached length ), where lines by definition run between not through nodes, even if another line goes out the other side in line with the first, and the class for the graph is a (stock) collection of nodes. Normal graphs have nodes ordered by coordinate x, y, z order. Normal lines will have the first node lower in order. Normal nodes have the lines in remote end order. Normalization can halve the computational load of many searches, and suggests an ordered collection like an array or tree, not a hash. However, if the majority of searches are equal, and there are many elements, hash mapping may be faster and collections should be considered orderless. If the set in your graphs is very dynamic and collections large, a linear hash or tree is good - no sliding arrays up and down. (Do intersecting lines make a node, or do they magically miss if no node is established, like ship lanes in the ocean?)

I suppose the lines could be in the node only, but they would be there twice -- if far node coord > this node coord then continue?

Might want a trivial class for coord that knows how to compare them.

Last edited by DGPickett; 10-05-2012 at 04:42 PM..
 

3 More Discussions You Might Find Interesting

1. Shell Programming and Scripting

Graph generation

How can I generate graphs using perl in unix solaris environment? Please suggest. (2 Replies)
Discussion started by: wadhwa.pooja
2 Replies

2. AIX

Performance graph

Guru's I need to develop a graph which shows the CPU, memory and swap space utilization in a single graph against time I know of NMON but I am not able to make a single graph out of it. Does anyone know of any script or tool for data sampling and developing graph? Thanks in advance ... (1 Reply)
Discussion started by: balaji_prk
1 Replies

3. Shell Programming and Scripting

FS Growth Graph

It's been a while since i've been here.. and hopefully you can help me. I have created a script to get the filesystem utilization. Now i want to create a growth graph, which would show how much kb we increase per day. Here's the data 03-02-2010 00:00:00: /dev/md/dsk/d30 46473377 7355320... (5 Replies)
Discussion started by: ryandegreat25
5 Replies
NAMEDNODEMAP(1) 					User Contributed Perl Documentation					   NAMEDNODEMAP(1)

NAME
XML::DOM::NamedNodeMap - A hash table interface for XML::DOM DESCRIPTION
Objects implementing the NamedNodeMap interface are used to represent collections of nodes that can be accessed by name. Note that NamedNodeMap does not inherit from NodeList; NamedNodeMaps are not maintained in any particular order. Objects contained in an object implementing NamedNodeMap may also be accessed by an ordinal index, but this is simply to allow convenient enumeration of the contents of a NamedNodeMap, and does not imply that the DOM specifies an order to these Nodes. Note that in this implementation, the objects added to a NamedNodeMap are kept in order. METHODS getNamedItem (name) Retrieves a node specified by name. Return Value: A Node (of any type) with the specified name, or undef if the specified name did not identify any node in the map. setNamedItem (arg) Adds a node using its nodeName attribute. As the nodeName attribute is used to derive the name which the node must be stored under, multiple nodes of certain types (those that have a "special" string value) cannot be stored as the names would clash. This is seen as preferable to allowing nodes to be aliased. Parameters: arg A node to store in a named node map. The node will later be accessible using the value of the nodeName attribute of the node. If a node with that name is already present in the map, it is replaced by the new one. Return Value: If the new Node replaces an existing node with the same name the previously existing Node is returned, otherwise undef is returned. DOMExceptions: o WRONG_DOCUMENT_ERR Raised if arg was created from a different document than the one that created the NamedNodeMap. o NO_MODIFICATION_ALLOWED_ERR Raised if this NamedNodeMap is readonly. o INUSE_ATTRIBUTE_ERR Raised if arg is an Attr that is already an attribute of another Element object. The DOM user must explicitly clone Attr nodes to re-use them in other elements. removeNamedItem (name) Removes a node specified by name. If the removed node is an Attr with a default value it is immediately replaced. Return Value: The node removed from the map or undef if no node with such a name exists. DOMException: o NOT_FOUND_ERR Raised if there is no node named name in the map. item (index) Returns the indexth item in the map. If index is greater than or equal to the number of nodes in the map, this returns undef. Return Value: The node at the indexth position in the NamedNodeMap, or undef if that is not a valid index. getLength Returns the number of nodes in the map. The range of valid child node indices is 0 to length-1 inclusive. Additional methods not in the DOM Spec getValues Returns a NodeList with the nodes contained in the NamedNodeMap. The NodeList is "live", in that it reflects changes made to the NamedNodeMap. When this method is called in a list context, it returns a regular perl list containing the values. Note that this list is not "live". E.g. @list = $map->getValues; # returns a perl list $nodelist = $map->getValues; # returns a NodeList (object ref.) for my $val ($map->getValues) # iterate over the values getChildIndex (node) Returns the index of the node in the NodeList as returned by getValues, or -1 if the node is not in the NamedNodeMap. dispose Removes all circular references in this NamedNodeMap and its descendants so the objects can be claimed for garbage collection. The objects should not be used afterwards. perl v5.8.0 2000-01-31 NAMEDNODEMAP(1)
All times are GMT -4. The time now is 11:53 PM.
Unix & Linux Forums Content Copyright 1993-2022. All Rights Reserved.
Privacy Policy