net.junaraki.annobase.type.graph

Class DependencyGraph

java.lang.Object

net.junaraki.annobase.util.graph.AbstractGraph<DependencyNode,DependencyRelation>

net.junaraki.annobase.type.graph.DependencyGraph

All Implemented Interfaces:

java.io.Serializable, Annotation, Graph<DependencyNode,DependencyRelation>

public class DependencyGraph
extends AbstractGraph<DependencyNode,DependencyRelation>
implements Annotation

See Also:

Serialized Form

Constructor Summary

Constructors

Constructor and Description
DependencyGraph(AnnotationBase annBase) Public constructor.

Method Summary

Modifier and Type	Method and Description
void	addToBase() Adds this annotation to an associated annotation base.
java.util.Set<DependencyNode>	getAdjacentVertices(DependencyNode depNode) Returns vertices adjacent to the given vertex.
AnnotationBase	getAnnotationBase() Returns the annotation base which this annotation belongs to.
java.util.List<DependencyNode>	getDependencyPath(DependencyNode src, DependencyNode dest) Returns the shortest path from the given source node to the given destination node, using Dijkstra's algorithm.
java.lang.String	getDependencyPathString(DependencyNode src, DependencyNode dest) Returns a string representing the shortest path from the given source node to the given destination node, using Dijkstra's algorithm.
java.lang.String	getDependencyPathString(DependencyNode src, java.lang.String srcStr, DependencyNode dest, java.lang.String destStr) Returns a string representing the shortest path from the given source node to the given destination node, using Dijkstra's algorithm.
java.util.List<DependencyRelation>	getDependencyRelationPath(DependencyNode src, DependencyNode dest) Returns the shortest path from the given source node to the given destination node, using Dijkstra's algorithm.
java.util.Set<DependencyRelation>	getEdges(DependencyNode depNode) Returns a collection of edges that the given vertex has.
DependencyNode	getRoot()
java.lang.String	getTypeName() Returns the type name of this annotation.
void	removeFromBase() Removes this annotation from an associated annotation base.
void	setRoot(DependencyNode root)

Methods inherited from class net.junaraki.annobase.util.graph.AbstractGraph

addEdge, addVertex, getEdges, getVertices, numEdges, numVertices

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

DependencyGraph

public DependencyGraph(AnnotationBase annBase)

Public constructor.

Parameters:

annBase -

Method Detail

getDependencyPath

public java.util.List<DependencyNode> getDependencyPath(DependencyNode src,
                                                        DependencyNode dest)

Returns the shortest path from the given source node to the given destination node, using Dijkstra's algorithm. This method returns the shortest path in terms of a list of dependency nodes.

Parameters:

src -

dest -

Returns:

getDependencyRelationPath

public java.util.List<DependencyRelation> getDependencyRelationPath(DependencyNode src,
                                                                    DependencyNode dest)

Returns the shortest path from the given source node to the given destination node, using Dijkstra's algorithm. This method returns the shortest path in terms of a list of dependency relations.

Parameters:

src -

dest -

Returns:

getDependencyPathString

public java.lang.String getDependencyPathString(DependencyNode src,
                                                DependencyNode dest)

Returns a string representing the shortest path from the given source node to the given destination node, using Dijkstra's algorithm.

Parameters:

src -

dest -

Returns:

getDependencyPathString

public java.lang.String getDependencyPathString(DependencyNode src,
                                                java.lang.String srcStr,
                                                DependencyNode dest,
                                                java.lang.String destStr)

Returns a string representing the shortest path from the given source node to the given destination node, using Dijkstra's algorithm.

Parameters:

src -

srcStr -

dest -

destStr -

Returns:

getTypeName

public java.lang.String getTypeName()

Description copied from interface: Annotation

Returns the type name of this annotation.

Specified by:

getTypeName in interface Annotation

Returns:

getAnnotationBase

public AnnotationBase getAnnotationBase()

Description copied from interface: Annotation

Returns the annotation base which this annotation belongs to.

Specified by:

getAnnotationBase in interface Annotation

Returns:

addToBase

public void addToBase()

Description copied from interface: Annotation

Adds this annotation to an associated annotation base. The association of the annotation with an annotation base is done in creating the annotation.

Specified by:

addToBase in interface Annotation

removeFromBase

public void removeFromBase()

Description copied from interface: Annotation

Removes this annotation from an associated annotation base.

Specified by:

removeFromBase in interface Annotation

getAdjacentVertices

public java.util.Set<DependencyNode> getAdjacentVertices(DependencyNode depNode)

Description copied from class: AbstractGraph

Returns vertices adjacent to the given vertex.

Specified by:

getAdjacentVertices in interface Graph<DependencyNode,DependencyRelation>

Specified by:

getAdjacentVertices in class AbstractGraph<DependencyNode,DependencyRelation>

Returns:

getEdges

public java.util.Set<DependencyRelation> getEdges(DependencyNode depNode)

Description copied from class: AbstractGraph

Returns a collection of edges that the given vertex has.

Specified by:

getEdges in interface Graph<DependencyNode,DependencyRelation>

Specified by:

getEdges in class AbstractGraph<DependencyNode,DependencyRelation>

Returns:

getRoot

public DependencyNode getRoot()

setRoot

public void setRoot(DependencyNode root)