UC Berkeley Group for User Interface Research Javadoc: Uses of Class edu.berkeley.guir.lib.graphs.Node

Overview

Package

Class

Use

Tree

Deprecated

Index

Help

UC Berkeley Group for User Interface Research
Updated November 17, 2000

PREV NEXT

FRAMES NO FRAMES

Uses of Class
edu.berkeley.guir.lib.graphs.Node

Packages that use Node
edu.berkeley.guir.lib.graphs	Some simple graph utilities.

Uses of Node in edu.berkeley.guir.lib.graphs

Methods in edu.berkeley.guir.lib.graphs that return Node

protected Node PathTree.data()
          Get the value at the root of this tree.

Node Edge.getSourceNode()
          Get the source Node of the Edge.

Node Edge.getDestNode()
          Get the destination Node of the Edge.

Node Path.getLastNode()
          Get the last Node added to this Path.

Node Graph.getNode(String strNodeName)
          Get a Node from this Graph.

Methods in edu.berkeley.guir.lib.graphs with parameters of type Node

protected void PathTree.setData(Node node)
          Set the value at the root of this tree.

boolean Path.contains(Node node)
          See if the specified Node is contained in this Adjacency List.

void Path.addNode(Node node)
          Add a Node to the end of the Path.

void Path.addNode(Node node, float weight)
          Add a Node to the end of the Path.

void Path.addNode(Node node, Float weight)
          Add a Node to the end of the Path.

void Graph.addNode(Node node)
          Add the Node if and only if it is not already in the Graph.

void Graph.removeNode(Node node)
          Remove this Node from the Graph.

void Graph.addDirectedEdge(Node nodeFrom, Node nodeTo)
          Add a directed edge with the default weight (GraphConst.DEFAULT_WEIGHT) from one node to another node.

void Graph.addDirectedEdge(Node nodeFrom, Node nodeTo, float weight)
          Add a directed edge with the specified weight from one node to another node.

void Graph.addUndirectedEdge(Node nodeFrom, Node nodeTo)
          Add an undirected edge with the default weight (GraphConst.DEFAULT_WEIGHT) from one node to another node.

void Graph.addUndirectedEdge(Node nodeFrom, Node nodeTo, float weight)
          Add an undirected edge with the specified weight from one node to another node.

void Graph.removeDirectedEdge(Node nodeFrom, Node nodeTo)
          Remove a directed edge from one node to another.

void Graph.removeUndirectedEdge(Node nodeFrom, Node nodeTo)
          Remove an undirected edge between two nodes.

boolean Graph.nodeExists(Node node)
          See if the given Node is in the Graph or not.

boolean Graph.isAdjacent(Node nodeFrom, Node nodeTo)
          See if you can get from the from-node to the to-node.

float Graph.getWeight(Node nodeFrom, Node nodeTo)
          Get the weight of the edge between the from-node to the to-node.

Constructors in edu.berkeley.guir.lib.graphs with parameters of type Node

PathTree(Node node)
          Creates a new PathTree.

Edge(Node nodeSrc, Node nodeDst)
          Constructor to create an Edge from a Node to another Node with a weight of GraphConst.DEFAULT_WEIGHT.

Edge(Node nodeSrc, Node nodeDst, float weight)
          Constructor to create an Edge from a Node to another Node with the specified weight.