Index (Graphs - parent 1.0.1 API)

A B C D E F G H I K L M N P R S T V W

A

ABORT - com.puresoltechnologies.graphs.trees.WalkingAction: This constant means to abort and not to proceed any more nodes.
AbstractStateModel<S extends State<S,T>,T extends Transition<S,T>> - Class in com.puresoltechnologies.graphs.statemodel: This is the abstract implementation of a state model.
AbstractStateModel() - Constructor for class com.puresoltechnologies.graphs.statemodel.AbstractStateModel: This is the default constructor.
AbstractStateModel(S) - Constructor for class com.puresoltechnologies.graphs.statemodel.AbstractStateModel: This constructor starts at a given initial state.
accepted(N) - Method in interface com.puresoltechnologies.graphs.trees.TreeSearchCriterion: This method returns whether a node is accepted as a search result or not.
addChild(N) - Method in class com.puresoltechnologies.graphs.trees.TreeNodeImpl: This method is used to add children to a parent node in the constructor.
addLabel(String) - Method in interface com.puresoltechnologies.graphs.trees.LabeledTreeNode: This method adds a label to the TreeNode.

B

BinarySearchTree<N extends BinaryTreeNode<N,Key,Value>,Key extends Comparable<Key>,Value> - Class in com.puresoltechnologies.graphs.trees: This is a base implementation of a binary search tree.
BinarySearchTree() - Constructor for class com.puresoltechnologies.graphs.trees.BinarySearchTree
BinarySearchTreeIterator<N extends BinaryTreeNode<N,Key,Value>,Key extends Comparable<Key>,Value> - Class in com.puresoltechnologies.graphs.trees
BinarySearchTreeIterator(N) - Constructor for class com.puresoltechnologies.graphs.trees.BinarySearchTreeIterator
BinarySearchTreeIterator(N, Key, Key) - Constructor for class com.puresoltechnologies.graphs.trees.BinarySearchTreeIterator
BinaryTreeNode<N extends BinaryTreeNode<N,Key,Value>,Key extends Comparable<Key>,Value> - Interface in com.puresoltechnologies.graphs.trees: This interface is an extension
BLACK - Static variable in class com.puresoltechnologies.graphs.trees.RedBlackTreeNode

C

canGoTo(S) - Method in class com.puresoltechnologies.graphs.statemodel.AbstractStateModel
canGoTo(S) - Method in interface com.puresoltechnologies.graphs.statemodel.StateModel: This method checks the available transitions and looks for a transition to go the defined state.
canPerformTransition(T) - Method in class com.puresoltechnologies.graphs.statemodel.AbstractStateModel
canPerformTransition(T) - Method in interface com.puresoltechnologies.graphs.statemodel.StateModel: This method checks whether a transition can be performed with the current state.
ceiling(Key) - Method in class com.puresoltechnologies.graphs.trees.RedBlackTree: Returns the smallest key in the symbol table greater than or equal to key.
ceilingNode(Key) - Method in class com.puresoltechnologies.graphs.trees.RedBlackTree: Returns the smallest key in the symbol table greater than or equal to key.
clear() - Method in class com.puresoltechnologies.graphs.trees.BinarySearchTree
com.puresoltechnologies.graphs.graph - package com.puresoltechnologies.graphs.graph
com.puresoltechnologies.graphs.statemodel - package com.puresoltechnologies.graphs.statemodel
com.puresoltechnologies.graphs.trees - package com.puresoltechnologies.graphs.trees
contains(Key) - Method in class com.puresoltechnologies.graphs.trees.BinarySearchTree: Checks whether a key exists in the tree.
countNodes(N) - Static method in class com.puresoltechnologies.graphs.trees.TreeUtils: This method counts all nodes within a tree.
CycleAnalyzer - Class in com.puresoltechnologies.graphs.graph
CycleAnalyzer() - Constructor for class com.puresoltechnologies.graphs.graph.CycleAnalyzer

D

DeadEndAnalyzer - Class in com.puresoltechnologies.graphs.graph: This class contains method to check and evaluate Graphs.
delete(Key) - Method in class com.puresoltechnologies.graphs.trees.BinarySearchTree: Removes the specified key and its associated value from tree.
delete(Key) - Method in class com.puresoltechnologies.graphs.trees.RedBlackTree: Removes the specified key and its associated value from this symbol table (if the key is in this symbol table).
deleteMax() - Method in class com.puresoltechnologies.graphs.trees.RedBlackTree: Removes the largest key and associated value from the symbol table.
deleteMin() - Method in class com.puresoltechnologies.graphs.trees.RedBlackTree: Removes the smallest key and associated value from the symbol table.

E

Edge<V extends Vertex<V,E>,E extends Edge<V,E>> - Interface in com.puresoltechnologies.graphs.graph: This interface represents a single edge which connects two vertices.
equals(Object) - Method in class com.puresoltechnologies.graphs.graph.Pair
equals(Object) - Method in class com.puresoltechnologies.graphs.trees.TreeLink
equalsWithoutOrder(N, N) - Static method in class com.puresoltechnologies.graphs.trees.TreeUtils: This method checks to trees for equality.

F

floor(Key) - Method in class com.puresoltechnologies.graphs.trees.RedBlackTree: Returns the largest key in the symbol table less than or equal to key.
floorNode(Key) - Method in class com.puresoltechnologies.graphs.trees.RedBlackTree: Returns the largest node with key in the symbol table less than or equal to key.

G

get(Key) - Method in class com.puresoltechnologies.graphs.trees.BinarySearchTree: Returns the value associated with the given key.
getChildren() - Method in class com.puresoltechnologies.graphs.trees.RedBlackTreeNode
getChildren() - Method in interface com.puresoltechnologies.graphs.trees.TreeNode: This method returns the children which are contained in the node.
getChildren() - Method in class com.puresoltechnologies.graphs.trees.TreeNodeImpl
getColor() - Method in class com.puresoltechnologies.graphs.trees.RedBlackTreeNode
getCurrentNode() - Method in class com.puresoltechnologies.graphs.trees.TreeIterator: This method returns the current node where the iterator is at the very moment.
getEdges() - Method in interface com.puresoltechnologies.graphs.graph.Vertex: This method returns the edges which are bound to the vertex.
getEdges() - Method in interface com.puresoltechnologies.graphs.statemodel.State
getEdges() - Method in class com.puresoltechnologies.graphs.trees.RedBlackTreeNode
getEdges() - Method in class com.puresoltechnologies.graphs.trees.TreeNodeImpl
getEndStates() - Method in interface com.puresoltechnologies.graphs.statemodel.StateModel: This method returns the possible end states of the model which show, that the model is finished and cannot be changed anymore.
getFirst() - Method in class com.puresoltechnologies.graphs.graph.Pair
getKey() - Method in interface com.puresoltechnologies.graphs.trees.BinaryTreeNode: This method returns the key of the node which is used to compare and sort the nodes within the tree.
getKey() - Method in class com.puresoltechnologies.graphs.trees.RedBlackTreeNode
getLabels() - Method in interface com.puresoltechnologies.graphs.trees.LabeledTreeNode: This method returns a Set of labels which were added to this TreeNode.
getLeft() - Method in interface com.puresoltechnologies.graphs.trees.BinaryTreeNode: Returns the left node of the binary tree node.
getLeft() - Method in class com.puresoltechnologies.graphs.trees.RedBlackTreeNode
getName() - Method in interface com.puresoltechnologies.graphs.statemodel.State: This method returns the localized name of the state which is needed to be presented in a UI.
getName() - Method in interface com.puresoltechnologies.graphs.statemodel.Transition: This method returns the localized name of the transition which is needed to be presented in a UI.
getName() - Method in class com.puresoltechnologies.graphs.trees.RedBlackTreeNode
getName() - Method in interface com.puresoltechnologies.graphs.trees.TreeNode: This method returns the node identifier.
getName() - Method in class com.puresoltechnologies.graphs.trees.TreeNodeImpl
getParent() - Method in class com.puresoltechnologies.graphs.trees.RedBlackTreeNode
getParent() - Method in interface com.puresoltechnologies.graphs.trees.TreeNode: This method returns the parent node.
getParent() - Method in class com.puresoltechnologies.graphs.trees.TreeNodeImpl
getProperties() - Method in interface com.puresoltechnologies.graphs.trees.PropertyTreeNode: This method returns a Map of properties which were added to this TreeNode.
getRight() - Method in interface com.puresoltechnologies.graphs.trees.BinaryTreeNode: Returns the right node of the binary tree node.
getRight() - Method in class com.puresoltechnologies.graphs.trees.RedBlackTreeNode
getRootNode() - Method in class com.puresoltechnologies.graphs.trees.BinarySearchTree
getRootNode() - Method in interface com.puresoltechnologies.graphs.trees.Tree: This method returns the root node of the tree.
getSearchResult() - Method in class com.puresoltechnologies.graphs.trees.SearchVisitor: This method returns the list of results found during tree walk.
getSecond() - Method in class com.puresoltechnologies.graphs.graph.Pair
getSize() - Method in class com.puresoltechnologies.graphs.trees.RedBlackTreeNode
getStartState() - Method in interface com.puresoltechnologies.graphs.statemodel.StateModel: This method returns the start state which is not valid, yet, but the starting point of the first transition to be made.
getState() - Method in class com.puresoltechnologies.graphs.statemodel.AbstractStateModel
getState() - Method in interface com.puresoltechnologies.graphs.statemodel.StateModel: This method returns the current State of the model.
getTargetState() - Method in interface com.puresoltechnologies.graphs.statemodel.Transition: This is the final state of the transition.
getTransitions() - Method in interface com.puresoltechnologies.graphs.statemodel.State: This method returns the valid, applicable transitions of the state.
getTree() - Method in class com.puresoltechnologies.graphs.trees.TreeWalker
getValue() - Method in interface com.puresoltechnologies.graphs.trees.BinaryTreeNode: This method returns the value of the node.
getValue() - Method in class com.puresoltechnologies.graphs.trees.RedBlackTreeNode
getVertices() - Method in interface com.puresoltechnologies.graphs.graph.Edge: This method returns the vertices which are connected by this edge.
getVertices() - Method in interface com.puresoltechnologies.graphs.graph.Graph: This method returns all vertices of the graph.
getVertices() - Method in class com.puresoltechnologies.graphs.trees.BinarySearchTree
getVertices() - Method in class com.puresoltechnologies.graphs.trees.TreeLink
goBackward() - Method in class com.puresoltechnologies.graphs.trees.TreeIterator: This method walks backward one node.
goForward() - Method in class com.puresoltechnologies.graphs.trees.TreeIterator: This method walks forward one node.
goTo(S) - Method in class com.puresoltechnologies.graphs.statemodel.AbstractStateModel
goTo(S) - Method in interface com.puresoltechnologies.graphs.statemodel.StateModel: This method checks the available transitions and looks for a transition to go the defined state.
gotoEnd() - Method in class com.puresoltechnologies.graphs.trees.TreeIterator: This method sets the iterator onto the last tree element.
gotoStart() - Method in class com.puresoltechnologies.graphs.trees.TreeIterator: This method resets the iterator and put the current node to the beginning.
Graph<V extends Vertex<V,E>,E extends Edge<V,E>> - Interface in com.puresoltechnologies.graphs.graph: This interface represents a whole graph.

H

hasChildren() - Method in class com.puresoltechnologies.graphs.trees.RedBlackTreeNode
hasChildren() - Method in interface com.puresoltechnologies.graphs.trees.TreeNode: This method returns whether or not the current node contains children.
hasChildren() - Method in class com.puresoltechnologies.graphs.trees.TreeNodeImpl
hasCycles(Graph<V, E>, boolean) - Static method in class com.puresoltechnologies.graphs.graph.CycleAnalyzer: This method searches a given Graph for cycles.
hasCycles(Graph<V, E>, V, boolean) - Static method in class com.puresoltechnologies.graphs.graph.CycleAnalyzer: This method searches a given Graph for cycles.
hasDeadEnds(Graph<V, E>, V, Set<V>) - Static method in class com.puresoltechnologies.graphs.graph.DeadEndAnalyzer: This method checks whether a graph has dead ends or not assuming the provided graph is directed and the Pairs in the Edges are interpreted with first and second Vertex as start and target state.
hasDisconnectedSubgraph(Graph<V, E>) - Static method in class com.puresoltechnologies.graphs.graph.SubgraphAnalyzer: This method searches a given Graph for disconnected subgraphs.
hasDisconnectedSubgraph(Graph<V, E>, V) - Static method in class com.puresoltechnologies.graphs.graph.SubgraphAnalyzer: This method searches a given Graph for cycles.
hashCode() - Method in class com.puresoltechnologies.graphs.graph.Pair
hashCode() - Method in class com.puresoltechnologies.graphs.trees.TreeLink
hasLabel(String) - Method in interface com.puresoltechnologies.graphs.trees.LabeledTreeNode: This method checks whether a certain label is present on this TreeNode or not.
hasNext() - Method in class com.puresoltechnologies.graphs.trees.BinarySearchTreeIterator
hasNext() - Method in class com.puresoltechnologies.graphs.trees.TreeIterator
hasProperty(String) - Method in interface com.puresoltechnologies.graphs.trees.PropertyTreeNode: This method checks whether a certain property is present on this TreeNode or not.
height() - Method in class com.puresoltechnologies.graphs.trees.RedBlackTree: Returns the height of the BST (for debugging).

I

isEmpty() - Method in class com.puresoltechnologies.graphs.trees.BinarySearchTree: Checks whether the tree is empty.
iterator() - Method in class com.puresoltechnologies.graphs.trees.BinarySearchTree
iterator() - Method in class com.puresoltechnologies.graphs.trees.TreeNodeImpl
iterator(Key, Key) - Method in class com.puresoltechnologies.graphs.trees.BinarySearchTree

K

keys() - Method in class com.puresoltechnologies.graphs.trees.RedBlackTree: Returns all keys in the symbol table as an Iterable.
keys(Key, Key) - Method in class com.puresoltechnologies.graphs.trees.RedBlackTree: Returns all keys in the symbol table in the given range, as an Iterable.

L

LabeledTreeNode<N extends LabeledTreeNode<N>> - Interface in com.puresoltechnologies.graphs.trees: This interface is a specialization of TreeNode and provides the feature to add labels to nodes.
LEAVE_BRANCH - com.puresoltechnologies.graphs.trees.WalkingAction: This constant means to leave the current branch and not to step any deeper.

M

max() - Method in class com.puresoltechnologies.graphs.trees.RedBlackTree: Returns the largest key in the symbol table.
min() - Method in class com.puresoltechnologies.graphs.trees.RedBlackTree: Returns the smallest key in the symbol table.

N

next() - Method in class com.puresoltechnologies.graphs.trees.BinarySearchTreeIterator
next() - Method in class com.puresoltechnologies.graphs.trees.TreeIterator

P

Pair<T> - Class in com.puresoltechnologies.graphs.graph: This class is used to model a pair of values.
Pair(T, T) - Constructor for class com.puresoltechnologies.graphs.graph.Pair
peek() - Method in class com.puresoltechnologies.graphs.trees.BinarySearchTreeIterator
performTransition(T) - Method in class com.puresoltechnologies.graphs.statemodel.AbstractStateModel
performTransition(T) - Method in interface com.puresoltechnologies.graphs.statemodel.StateModel: This method performs the transition provided.
println(Tree<N>) - Method in class com.puresoltechnologies.graphs.trees.TreePrinter: This method is used to print the tree provided into the PrintStream set in the constructor TreePrinter(PrintStream).
println(N) - Method in class com.puresoltechnologies.graphs.trees.TreePrinter: This method is used to print the tree provided into the PrintStream set in the constructor TreePrinter(PrintStream).
PROCEED - com.puresoltechnologies.graphs.trees.WalkingAction: This constant means to proceed node by node as normal.
PropertyTreeNode<N extends LabeledTreeNode<N>> - Interface in com.puresoltechnologies.graphs.trees: This interface is a specialization of TreeNode and provides the feature to add properties to nodes.
put(Key, Value) - Method in class com.puresoltechnologies.graphs.trees.BinarySearchTree: This method is used to put a new node into the tree.
put(Key, Value) - Method in class com.puresoltechnologies.graphs.trees.RedBlackTree: Inserts the specified key-value pair into the symbol table, overwriting the old value with the new value if the symbol table already contains the specified key.

R

rank(Key) - Method in class com.puresoltechnologies.graphs.trees.RedBlackTree: Return the number of keys in the symbol table strictly less than key.
RED - Static variable in class com.puresoltechnologies.graphs.trees.RedBlackTreeNode
RedBlackTree<Key extends Comparable<Key>,Value> - Class in com.puresoltechnologies.graphs.trees: This is a RedBlackTree implementation based on BinarySearchTree.
RedBlackTree() - Constructor for class com.puresoltechnologies.graphs.trees.RedBlackTree
RedBlackTreeNode<Key extends Comparable<Key>,Value> - Class in com.puresoltechnologies.graphs.trees
RedBlackTreeNode(Key, Value, boolean, int) - Constructor for class com.puresoltechnologies.graphs.trees.RedBlackTreeNode
remove() - Method in class com.puresoltechnologies.graphs.trees.TreeIterator
removeLabel(String) - Method in interface com.puresoltechnologies.graphs.trees.LabeledTreeNode: Removes a label from the TreeNode.
removeProperty(String) - Method in interface com.puresoltechnologies.graphs.trees.PropertyTreeNode: Removes a label from the TreeNode.
root - Variable in class com.puresoltechnologies.graphs.trees.BinarySearchTree

S

SearchVisitor<N extends TreeNode<N>> - Class in com.puresoltechnologies.graphs.trees: This TreeVisitor implementation is for searching a whole tree for a special TreeSearchCriterion.
SearchVisitor(TreeSearchCriterion<N>) - Constructor for class com.puresoltechnologies.graphs.trees.SearchVisitor
select(int) - Method in class com.puresoltechnologies.graphs.trees.RedBlackTree: Return the kth smallest key in the symbol table.
setColor(boolean) - Method in class com.puresoltechnologies.graphs.trees.RedBlackTreeNode
setKey(Key) - Method in class com.puresoltechnologies.graphs.trees.RedBlackTreeNode
setLeft(RedBlackTreeNode<Key, Value>) - Method in class com.puresoltechnologies.graphs.trees.RedBlackTreeNode
setProperty(String, Object) - Method in interface com.puresoltechnologies.graphs.trees.PropertyTreeNode: This method adds sets a property to the TreeNode.
setRight(RedBlackTreeNode<Key, Value>) - Method in class com.puresoltechnologies.graphs.trees.RedBlackTreeNode
setSize(int) - Method in class com.puresoltechnologies.graphs.trees.RedBlackTreeNode
setState(S) - Method in class com.puresoltechnologies.graphs.statemodel.AbstractStateModel
setValue(Value) - Method in class com.puresoltechnologies.graphs.trees.RedBlackTreeNode
size() - Method in class com.puresoltechnologies.graphs.trees.RedBlackTree
size(Key, Key) - Method in class com.puresoltechnologies.graphs.trees.RedBlackTree: Returns the number of keys in the symbol table in the given range.
State<S extends State<S,T>,T extends Transition<S,T>> - Interface in com.puresoltechnologies.graphs.statemodel: This is a single state of the system within the state model.
StateModel<S extends State<S,T>,T extends Transition<S,T>> - Interface in com.puresoltechnologies.graphs.statemodel: This is an interface for a state model.
StateModelException - Exception in com.puresoltechnologies.graphs.statemodel: This exception is thrown in cases of issues with the state model.
StateModelException(String) - Constructor for exception com.puresoltechnologies.graphs.statemodel.StateModelException
StateModelException(String, Throwable) - Constructor for exception com.puresoltechnologies.graphs.statemodel.StateModelException
StateModelVerfier - Class in com.puresoltechnologies.graphs.statemodel: This class contains method to check and evaluate StateModel objects.
SubgraphAnalyzer - Class in com.puresoltechnologies.graphs.graph
SubgraphAnalyzer() - Constructor for class com.puresoltechnologies.graphs.graph.SubgraphAnalyzer

T

toString() - Method in class com.puresoltechnologies.graphs.trees.RedBlackTreeNode
Transition<S extends State<S,T>,T extends Transition<S,T>> - Interface in com.puresoltechnologies.graphs.statemodel: This interface represents a single transition within the state model.
Tree<N extends TreeNode<N>> - Interface in com.puresoltechnologies.graphs.trees: This is the interface for a Tree Graph.
TreeException - Exception in com.puresoltechnologies.graphs.trees: This exception is thrown if a tree function or action is not suitable or invalid.
TreeException(String) - Constructor for exception com.puresoltechnologies.graphs.trees.TreeException
TreeException(String, Throwable) - Constructor for exception com.puresoltechnologies.graphs.trees.TreeException
TreeIterator<N extends TreeNode<N>> - Class in com.puresoltechnologies.graphs.trees: This is a simple tree iterator for all trees implementing the tree interface.
TreeIterator(N) - Constructor for class com.puresoltechnologies.graphs.trees.TreeIterator: This constructor instantiates the object.
TreeLink<N extends TreeNode<N>> - Class in com.puresoltechnologies.graphs.trees
TreeLink(N, N) - Constructor for class com.puresoltechnologies.graphs.trees.TreeLink
TreeNode<N extends TreeNode<N>> - Interface in com.puresoltechnologies.graphs.trees: This is the most simple interface to a single tree node.
TreeNodeImpl<N extends TreeNodeImpl<N>> - Class in com.puresoltechnologies.graphs.trees: This is an abstract, immutable implementation of a TreeNode.
TreeNodeImpl(N, String) - Constructor for class com.puresoltechnologies.graphs.trees.TreeNodeImpl: This is the initial value constructor.
TreePrinter - Class in com.puresoltechnologies.graphs.trees: This class prints a tree to a specified PrintStream.
TreePrinter(PrintStream) - Constructor for class com.puresoltechnologies.graphs.trees.TreePrinter: Constructor to instantiate this class.
TreeSearchCriterion<N extends TreeNode<N>> - Interface in com.puresoltechnologies.graphs.trees: This is a simple interface to specify a tree search criterion.
TreeUtils - Class in com.puresoltechnologies.graphs.trees: This class contains helper method to work with trees.
TreeVisitor<N extends TreeNode<N>> - Interface in com.puresoltechnologies.graphs.trees: This is the simple interface for a tree visitor.
TreeWalker<N extends TreeNode<N>> - Class in com.puresoltechnologies.graphs.trees: This is a simple tree walker for all trees implementing the tree interface.
TreeWalker(N) - Constructor for class com.puresoltechnologies.graphs.trees.TreeWalker

V

valueOf(String) - Static method in enum com.puresoltechnologies.graphs.trees.WalkingAction: Returns the enum constant of this type with the specified name.
values() - Static method in enum com.puresoltechnologies.graphs.trees.WalkingAction: Returns an array containing the constants of this enum type, in the order they are declared.
verifyModel(StateModel<S, T>) - Static method in class com.puresoltechnologies.graphs.statemodel.StateModelVerfier: This method checks for the basic contracts of the state model: There is exact one, non-null start state. The start state has at least one transition. The end state set is not null. The end states do not have transitions. The current state is not null.
Vertex<V extends Vertex<V,E>,E extends Edge<V,E>> - Interface in com.puresoltechnologies.graphs.graph: This interface represents a single vertex in a Graph.
visit(N) - Method in class com.puresoltechnologies.graphs.trees.SearchVisitor
visit(N) - Method in interface com.puresoltechnologies.graphs.trees.TreeVisitor: This method is called for every node in the tree.

W

walk(TreeVisitor<N>) - Method in class com.puresoltechnologies.graphs.trees.TreeWalker: This method is used to start the walking process.
walk(TreeVisitor<N>, N) - Static method in class com.puresoltechnologies.graphs.trees.TreeWalker
walkBackward(TreeVisitor<N>) - Method in class com.puresoltechnologies.graphs.trees.TreeWalker: This method is used to start the walking process in an reverse order.
walkBackward(TreeVisitor<N>, N) - Static method in class com.puresoltechnologies.graphs.trees.TreeWalker
WalkingAction - Enum in com.puresoltechnologies.graphs.trees: This enum contains the possibilities how the process can be proceeded in each single node.

A B C D E F G H I K L M N P R S T V W