An object representing the interstitial cell in most linked data structures. More...
Public Member Functions
|node (int number_of_links=0)|
|the constructor provides for "number_of_links" links initially. |
|the destructor simply invalidates the node. |
|int||links () const|
|Returns the number of links the node currently holds. |
|void||set_link (int link_number, node *new_link)|
|Connects the node "new_link" to this node. |
|node *||get_link (int link_number) const|
|Returns the node that is connected to the specified "link_number". |
|void||zap_link (int link_number)|
|the specified link is removed from the node. |
|void||insert_link (int where, node *to_add=NIL)|
|adds a new link prior to the position specified in "where". |
|int||which (node *to_find) const|
|locates the index where "to_find" lives in our list of links. |
An object representing the interstitial cell in most linked data structures.
The node is intended as an extensible base class that provides general connectivity support. Nodes can be connected to each other in arbitrary ways, but often a derived data type provides more structured organization. When a node's link is zapped, only the connection is cut; no destruction is performed.
Examples: A linked list can be represented as a node with one link that connects to the succeeding item in the list. A doubly linked list can be represented by a node with two links; one to the previous node and the other to the next node. The most general structure might be an arbitrary graph that can connect nodes to any number of other nodes.
|nodes::node::node||(||int|| number_of_links =
the constructor provides for "number_of_links" links initially.
the table below gives some common numbers for links for a variety of data structures:
Links Data Structure Purpose of Link(s) ------ ------------------------- ---------------------------------- 1 singly linked list points to next node in list 2 doubly linked list one to previous node, one to next 2 binary tree point to the two children n n-ary tree point to the n children n+1 n-ary doubly linked tree point to n children and 1 parent m m-ary graph node point to m relatives.
the destructor simply invalidates the node.
this does not rearrange the links as would be appropriate for a data structure in which only the node to be destroyed is being eliminated. policies regarding the correct management of the links must be made in objects derived from node.
|node * nodes::node::get_link||(||int||link_number||)||const|
Returns the node that is connected to the specified "link_number".
if the link is not set, then NIL is returned.
|node *|| to_add = |
adds a new link prior to the position specified in "where".
thus a "where" value of less than or equal to zero will add a new link as the first element. a "where" value greater than or equal to links() will add a new link after the last element. the node "to_add" will be stored in the new link.
Connects the node "new_link" to this node.
the previous link is lost, but not modified in any way. the address of the new link is used directly--no copy of the node is made. setting a link to a null node pointer clears that link.
|int nodes::node::which||(||node *||to_find||)||const|