All Packages  Class Hierarchy  This Package  Previous  Next  Index

Class jdsl.core.ref.AMSGraphTree

java.lang.Object
   |
   +----jdsl.core.ref.AMSGraphTree

public class AMSGraphTree
extends Object
implements InspectableGraph, InspectableTree
An AMSGraphTree implements a rooted InspectableTree that is also an InspectableGraph. No vertex may have an inDegree greater than 1, and only the root node may have inDegree of 0, maintaining the parent-child hierarchy of the tree. One possible modification to this data structure might be to implement a Forest-Graph.


Constructor Index

 o AMSGraphTree()

Method Index

 o adjacentVertices(Vertex)
 o castEdge(Position)
 o castMutable(Position)
Casting methods
 o castVertex(Position)
 o children(Position)
 o degree(Vertex)
 o destination(Edge)
 o directedEdges()
 o edges()
 o elements()
 o endVertices(Edge)
 o inAdjacentVertices(Vertex)
 o incidentEdges(Vertex)
 o inDegree(Vertex)
 o inIncidentEdges(Vertex)
 o insertChild(Position, Object)
 o insertDirectedEdge(Vertex, Vertex, Object)
 o insertRoot(Object)
 o insertVertex(Object)
Insertion methods
 o isDirected(Edge)
 o isEmpty()
 o isExternal(Position)
 o isInternal(Position)
 o isRoot(Position)
InspectableTree methods
 o newContainer()
Container methods
 o numEdges()
 o numVertices()
InspectableGraph methods
 o opposite(Vertex, Edge)
 o origin(Edge)
 o outAdjacentVertices(Vertex)
 o outDegree(Vertex)
 o outIncidentEdges(Vertex)
 o parent(Position)
 o positions()
PositionalContainer methods
 o replace(Position, Object)
 o root()
 o siblings(Position)
 o size()
 o swap(Position, Position)
 o undirectedEdges()
 o vertices()

Constructors

 o AMSGraphTree
 public AMSGraphTree()

Methods

 o newContainer
 public Container newContainer()
Container methods

 o size
 public int size()
 o isEmpty
 public boolean isEmpty()
 o elements
 public Enumeration elements()
 o positions
 public Enumeration positions()
PositionalContainer methods

 o replace
 public Object replace(Position p,
                       Object obj) throws InvalidPositionException
 o swap
 public void swap(Position a,
                  Position b)
 o numVertices
 public int numVertices()
InspectableGraph methods

 o numEdges
 public int numEdges()
 o vertices
 public Enumeration vertices()
 o edges
 public Enumeration edges()
 o directedEdges
 public Enumeration directedEdges()
 o undirectedEdges
 public Enumeration undirectedEdges()
 o degree
 public int degree(Vertex v) throws InvalidPositionException
 o inDegree
 public int inDegree(Vertex v) throws InvalidPositionException
 o outDegree
 public int outDegree(Vertex v) throws InvalidPositionException
 o adjacentVertices
 public Enumeration adjacentVertices(Vertex v) throws InvalidPositionException
 o inAdjacentVertices
 public Enumeration inAdjacentVertices(Vertex v) throws InvalidPositionException
 o outAdjacentVertices
 public Enumeration outAdjacentVertices(Vertex v) throws InvalidPositionException
 o incidentEdges
 public Enumeration incidentEdges(Vertex v) throws InvalidPositionException
 o inIncidentEdges
 public Enumeration inIncidentEdges(Vertex v) throws InvalidPositionException
 o outIncidentEdges
 public Enumeration outIncidentEdges(Vertex v) throws InvalidPositionException
 o endVertices
 public Vertex[] endVertices(Edge e) throws InvalidPositionException
 o opposite
 public Vertex opposite(Vertex v,
                        Edge e) throws InvalidPositionException, InvalidEdgeException
 o origin
 public Vertex origin(Edge e) throws InvalidPositionException, InvalidEdgeException
 o destination
 public Vertex destination(Edge e) throws InvalidPositionException, InvalidEdgeException
 o isDirected
 public boolean isDirected(Edge e) throws InvalidEdgeException
 o isRoot
 public boolean isRoot(Position p) throws InvalidPositionException, InvalidContainerException
InspectableTree methods

 o isInternal
 public boolean isInternal(Position p) throws InvalidContainerException, InvalidPositionException
 o isExternal
 public boolean isExternal(Position p) throws InvalidContainerException, InvalidPositionException
 o root
 public Position root() throws InvalidContainerException
 o parent
 public Position parent(Position p) throws InvalidContainerException, InvalidPositionException
 o children
 public Enumeration children(Position p) throws InvalidPositionException, InvalidContainerException
 o siblings
 public Enumeration siblings(Position p) throws InvalidContainerException, InvalidPositionException
 o insertVertex
 public Vertex insertVertex(Object info)
Insertion methods

 o insertDirectedEdge
 public Edge insertDirectedEdge(Vertex v1,
                                Vertex v2,
                                Object obj) throws InvalidPositionException, InvalidInsertionException
 o insertRoot
 public Position insertRoot(Object info) throws InvalidInsertionException
 o insertChild
 public Position insertChild(Position parent,
                             Object info) throws InvalidPositionException
 o castMutable
 public MutablePosition castMutable(Position p) throws InvalidPositionException
Casting methods

 o castVertex
 public AMSGTVertex castVertex(Position p) throws InvalidPositionException
 o castEdge
 public AMSGTEdge castEdge(Position p) throws InvalidPositionException

All Packages  Class Hierarchy  This Package  Previous  Next  Index