|
UC Berkeley Group for User Interface Research Updated November 17, 2000 |
|||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use edu.berkeley.guir.lib.graphs | |
edu.berkeley.guir.lib.graphs | Some simple graph utilities. |
Classes in edu.berkeley.guir.lib.graphs used by edu.berkeley.guir.lib.graphsBinarySearchTree
|
An tree that has at most two children per node ordered such that all values less than the root value will go to the left, and all values greater than the root value will go to the right. BinaryTree
|
An abstract tree that has at most two children per node. Graph
|
A container for a graph. GraphConst
|
Contains various Graph constants. GraphSearch
|
An interface that defines a graph search method. Node
|
A single Node in a Graph, as well as the adjacency list of inlinks (what other Nodes are connected to this Node) and outlinks (what other Nodes can we get to from this Node). Path
|
An object representing a Path in a Graph. PathTree
|
A Path Tree that represents a hierarchy of siblings and children. PathTreeFormatter
|
An interface that specifies how a PathTree will be displayed as text. |
|
Copyright Information | |||||||||
PREV NEXT | FRAMES NO FRAMES |