A B C D E F G H I N O P R S T
All Classes All Packages
All Classes All Packages
All Classes All Packages
A
- addChild(N) - Method in class cdc.util.graphs.impl.BasicTreeNode
- addEdge(E) - Method in class cdc.util.graphs.impl.BasicHeavyGraph
- addEdge(E) - Method in class cdc.util.graphs.impl.ExplicitSubGraph
-
Add an edge and the associated nodes to the subgraph.
- addEdge(E) - Method in class cdc.util.graphs.impl.ExtensionSubGraph
- addEdge(E) - Method in class cdc.util.graphs.impl.RestrictionSubGraph
- addEdge(N, N) - Method in class cdc.util.graphs.impl.BasicSuperLightGraph
- addEdge(X) - Method in class cdc.util.graphs.impl.BasicLightGraph
-
Adds an edge to this graph.
- addNode(N) - Method in class cdc.util.graphs.impl.BasicHeavyGraph
- addNode(N) - Method in class cdc.util.graphs.impl.ExplicitSubGraph
-
Add a node to the subgraph.
- addNode(N) - Method in class cdc.util.graphs.impl.ExtensionSubGraph
- addNode(N) - Method in class cdc.util.graphs.impl.RestrictionSubGraph
- addNode(X) - Method in class cdc.util.graphs.impl.BasicLightGraph
-
Adds a node to this graph.
B
- BasicGraphEdge<N> - Class in cdc.util.graphs.impl
-
Base and naive implementation of graph edge.
- BasicGraphEdge(N, N) - Constructor for class cdc.util.graphs.impl.BasicGraphEdge
- BasicGraphHeavyNode<E> - Class in cdc.util.graphs.impl
- BasicGraphHeavyNode() - Constructor for class cdc.util.graphs.impl.BasicGraphHeavyNode
- BasicHeavyGraph<N extends BasicGraphHeavyNode<E>,E extends BasicGraphEdge<N>> - Class in cdc.util.graphs.impl
-
Basic and naive graph implementation.
- BasicHeavyGraph() - Constructor for class cdc.util.graphs.impl.BasicHeavyGraph
- BasicLightGraph<N,E extends GraphEdge<N>> - Class in cdc.util.graphs.impl
-
Basic and naive graph implementation using light nodes.
- BasicLightGraph() - Constructor for class cdc.util.graphs.impl.BasicLightGraph
- BasicLightGraph(boolean) - Constructor for class cdc.util.graphs.impl.BasicLightGraph
- BasicSuperLightGraph<N> - Class in cdc.util.graphs.impl
- BasicSuperLightGraph() - Constructor for class cdc.util.graphs.impl.BasicSuperLightGraph
- BasicTree<N extends BasicTreeNode<N>> - Class in cdc.util.graphs.impl
- BasicTree() - Constructor for class cdc.util.graphs.impl.BasicTree
- BasicTreeNode<N extends BasicTreeNode<N>> - Class in cdc.util.graphs.impl
- BasicTreeNode() - Constructor for class cdc.util.graphs.impl.BasicTreeNode
- BasicTreeNode(N) - Constructor for class cdc.util.graphs.impl.BasicTreeNode
C
- cdc.util.graphs.impl - package cdc.util.graphs.impl
- checkEdgeValidity(E) - Method in class cdc.util.graphs.impl.GraphFilter
-
Checks that an edge belongs to delegate.
- checkNodeValidity(N) - Method in class cdc.util.graphs.impl.GraphFilter
-
Checks that a node belongs to delegate.
- clear() - Method in class cdc.util.graphs.impl.BasicHeavyGraph
- clear() - Method in class cdc.util.graphs.impl.BasicLightGraph
-
Clears this graph.
- clear() - Method in class cdc.util.graphs.impl.ExplicitSubGraph
-
Make the subgraph empty.
- clear() - Method in class cdc.util.graphs.impl.ExtensionSubGraph
- clear() - Method in class cdc.util.graphs.impl.RestrictionSubGraph
- containsEdge(BasicGraphEdge<N>) - Method in class cdc.util.graphs.impl.TreeAsGraph
- containsEdge(E) - Method in class cdc.util.graphs.impl.BasicHeavyGraph
- containsEdge(E) - Method in class cdc.util.graphs.impl.BasicLightGraph
- containsEdge(E) - Method in class cdc.util.graphs.impl.ExtensionSubGraph
- containsEdge(E) - Method in class cdc.util.graphs.impl.FilteredSubGraph
- containsEdge(E) - Method in class cdc.util.graphs.impl.ImplicitSubGraph
- containsEdge(E) - Method in class cdc.util.graphs.impl.InvertedGraph
- containsEdge(E) - Method in class cdc.util.graphs.impl.RestrictionSubGraph
- containsEdge(N, N) - Method in class cdc.util.graphs.impl.BasicLightGraph
-
Return
trueif this graph contains at least one edge between a source node and a target node. - containsNode(N) - Method in class cdc.util.graphs.impl.BasicHeavyGraph
- containsNode(N) - Method in class cdc.util.graphs.impl.BasicLightGraph
- containsNode(N) - Method in class cdc.util.graphs.impl.ExtensionSubGraph
- containsNode(N) - Method in class cdc.util.graphs.impl.FilteredSubGraph
- containsNode(N) - Method in class cdc.util.graphs.impl.InvertedGraph
- containsNode(N) - Method in class cdc.util.graphs.impl.RestrictionSubGraph
- containsNode(N) - Method in class cdc.util.graphs.impl.TreeAsGraph
D
- delegate - Variable in class cdc.util.graphs.impl.GraphFilter
E
- edges - Variable in class cdc.util.graphs.impl.ExtensionSubGraph
-
Set of edges.
- equals(Object) - Method in class cdc.util.graphs.impl.BasicGraphEdge
- ExplicitSubGraph<N,E> - Class in cdc.util.graphs.impl
-
Base class use to construct subgraphs by explicitly defining their content.
- ExplicitSubGraph(GraphAdapter<N, E>) - Constructor for class cdc.util.graphs.impl.ExplicitSubGraph
- ExtensionSubGraph<N,E> - Class in cdc.util.graphs.impl
-
Explicit subgraph defined by extension.
- ExtensionSubGraph(GraphAdapter<N, E>) - Constructor for class cdc.util.graphs.impl.ExtensionSubGraph
F
- FilteredSubGraph<N,E> - Class in cdc.util.graphs.impl
-
Graph built from an underlying graph, by applying filters to nodes and edges.
- FilteredSubGraph(GraphAdapter<N, E>) - Constructor for class cdc.util.graphs.impl.FilteredSubGraph
- FilteredSubGraph(GraphAdapter<N, E>, Predicate<N>, Predicate<E>) - Constructor for class cdc.util.graphs.impl.FilteredSubGraph
G
- getChildren() - Method in class cdc.util.graphs.impl.BasicTreeNode
- getChildren(N) - Method in class cdc.util.graphs.impl.BasicTree
- getDelegate() - Method in class cdc.util.graphs.impl.GraphFilter
- getEdges() - Method in class cdc.util.graphs.impl.BasicHeavyGraph
- getEdges() - Method in class cdc.util.graphs.impl.BasicLightGraph
- getEdges() - Method in class cdc.util.graphs.impl.ExtensionSubGraph
- getEdges() - Method in class cdc.util.graphs.impl.FilteredSubGraph
- getEdges() - Method in class cdc.util.graphs.impl.ImplicitSubGraph
- getEdges() - Method in class cdc.util.graphs.impl.InvertedGraph
- getEdges() - Method in class cdc.util.graphs.impl.RestrictionSubGraph
- getEdges() - Method in class cdc.util.graphs.impl.TreeAsGraph
- getEdges(N, EdgeDirection) - Method in class cdc.util.graphs.impl.BasicHeavyGraph
- getEdges(N, EdgeDirection) - Method in class cdc.util.graphs.impl.BasicLightGraph
- getEdges(N, EdgeDirection) - Method in class cdc.util.graphs.impl.ExtensionSubGraph
- getEdges(N, EdgeDirection) - Method in class cdc.util.graphs.impl.FilteredSubGraph
- getEdges(N, EdgeDirection) - Method in class cdc.util.graphs.impl.ImplicitSubGraph
- getEdges(N, EdgeDirection) - Method in class cdc.util.graphs.impl.InvertedGraph
- getEdges(N, EdgeDirection) - Method in class cdc.util.graphs.impl.RestrictionSubGraph
- getEdges(N, EdgeDirection) - Method in class cdc.util.graphs.impl.TreeAsGraph
- getIngoings() - Method in class cdc.util.graphs.impl.BasicGraphHeavyNode
- getNodes() - Method in class cdc.util.graphs.impl.BasicHeavyGraph
- getNodes() - Method in class cdc.util.graphs.impl.BasicLightGraph
- getNodes() - Method in class cdc.util.graphs.impl.ExtensionSubGraph
- getNodes() - Method in class cdc.util.graphs.impl.FilteredSubGraph
- getNodes() - Method in class cdc.util.graphs.impl.ImplicitSubGraph
- getNodes() - Method in class cdc.util.graphs.impl.InvertedGraph
- getNodes() - Method in class cdc.util.graphs.impl.RestrictionSubGraph
- getNodes() - Method in class cdc.util.graphs.impl.TreeAsGraph
- getOutgoings() - Method in class cdc.util.graphs.impl.BasicGraphHeavyNode
- getParent() - Method in class cdc.util.graphs.impl.BasicTreeNode
- getParent(N) - Method in class cdc.util.graphs.impl.BasicTree
- getRemovedEdges() - Method in class cdc.util.graphs.impl.RestrictionSubGraph
- getRemovedNodes() - Method in class cdc.util.graphs.impl.RestrictionSubGraph
- getRoot() - Method in class cdc.util.graphs.impl.TreeAsGraph
-
Returns the tree root seen by the graph.
- getSource() - Method in class cdc.util.graphs.impl.BasicGraphEdge
- getTarget() - Method in class cdc.util.graphs.impl.BasicGraphEdge
- getTip(BasicGraphEdge<N>, EdgeTip) - Method in class cdc.util.graphs.impl.TreeAsGraph
- getTip(E, EdgeTip) - Method in class cdc.util.graphs.impl.BasicHeavyGraph
- getTip(E, EdgeTip) - Method in class cdc.util.graphs.impl.BasicLightGraph
- getTip(E, EdgeTip) - Method in class cdc.util.graphs.impl.ExtensionSubGraph
- getTip(E, EdgeTip) - Method in class cdc.util.graphs.impl.FilteredSubGraph
- getTip(E, EdgeTip) - Method in class cdc.util.graphs.impl.ImplicitSubGraph
- getTip(E, EdgeTip) - Method in class cdc.util.graphs.impl.InvertedGraph
- getTip(E, EdgeTip) - Method in class cdc.util.graphs.impl.RestrictionSubGraph
- GraphEdgeIngoingPredicate<N> - Class in cdc.util.graphs.impl
-
Edge predicate for ingoing edges of a node.
- GraphEdgeIngoingPredicate(N) - Constructor for class cdc.util.graphs.impl.GraphEdgeIngoingPredicate
- GraphEdgeOutgoingPredicate<N> - Class in cdc.util.graphs.impl
-
Edge predicate for outgoing edges of a node.
- GraphEdgeOutgoingPredicate(N) - Constructor for class cdc.util.graphs.impl.GraphEdgeOutgoingPredicate
- GraphFilter<N,E> - Class in cdc.util.graphs.impl
-
Base class used to filter a graph and make it appear as another graph.
- GraphFilter(GraphAdapter<N, E>) - Constructor for class cdc.util.graphs.impl.GraphFilter
- GraphPrinter - Class in cdc.util.graphs.impl
-
Utility class used to print a graph as text.
H
- hasChildren(N) - Method in class cdc.util.graphs.impl.BasicTree
- hashCode() - Method in class cdc.util.graphs.impl.BasicGraphEdge
I
- ImplicitSubGraph<N,E> - Class in cdc.util.graphs.impl
-
Base implementation of implicit subgraph.
- ImplicitSubGraph(GraphAdapter<N, E>) - Constructor for class cdc.util.graphs.impl.ImplicitSubGraph
- ingoings - Variable in class cdc.util.graphs.impl.BasicGraphHeavyNode
- InvertedGraph<N,E> - Class in cdc.util.graphs.impl
-
Create an inverted view of a Graph.
- InvertedGraph(GraphAdapter<N, E>) - Constructor for class cdc.util.graphs.impl.InvertedGraph
- isEmpty() - Method in class cdc.util.graphs.impl.ExplicitSubGraph
-
Return whether the subgraph is empty or not.
- isEmpty() - Method in class cdc.util.graphs.impl.ExtensionSubGraph
- isEmpty() - Method in class cdc.util.graphs.impl.RestrictionSubGraph
- isLocked() - Method in class cdc.util.graphs.impl.BasicHeavyGraph
- isLocked() - Method in class cdc.util.graphs.impl.BasicLightGraph
N
- node - Variable in class cdc.util.graphs.impl.GraphEdgeIngoingPredicate
-
Reference node.
- node - Variable in class cdc.util.graphs.impl.GraphEdgeOutgoingPredicate
-
Reference node.
O
- outgoings - Variable in class cdc.util.graphs.impl.BasicGraphHeavyNode
P
- print(GraphAdapter<N, E>, boolean, PrintStream) - Static method in class cdc.util.graphs.impl.GraphPrinter
-
Print a graph (adapter) to an output stream.
R
- removeChild(BasicTreeNode<?>) - Method in class cdc.util.graphs.impl.BasicTreeNode
- removedEdges - Variable in class cdc.util.graphs.impl.RestrictionSubGraph
-
Set of removed edges.
- removedNodes - Variable in class cdc.util.graphs.impl.RestrictionSubGraph
-
Set of removed nodes.
- removeEdge(E) - Method in class cdc.util.graphs.impl.BasicHeavyGraph
- removeEdge(E) - Method in class cdc.util.graphs.impl.BasicLightGraph
-
Removes an edge from this graph.
- removeEdge(E) - Method in class cdc.util.graphs.impl.ExplicitSubGraph
-
Remove one edge.
- removeEdge(E) - Method in class cdc.util.graphs.impl.ExtensionSubGraph
- removeEdge(E) - Method in class cdc.util.graphs.impl.RestrictionSubGraph
- removeEdges(N, N) - Method in class cdc.util.graphs.impl.ExplicitSubGraph
-
Remove all edges between a source and a target node.
- removeEdges(N, N) - Method in class cdc.util.graphs.impl.ExtensionSubGraph
- removeEdges(N, N) - Method in class cdc.util.graphs.impl.RestrictionSubGraph
- removeNode(N) - Method in class cdc.util.graphs.impl.BasicHeavyGraph
- removeNode(N) - Method in class cdc.util.graphs.impl.BasicLightGraph
-
Remove a node from this graph.
- removeNode(N) - Method in class cdc.util.graphs.impl.ExplicitSubGraph
-
Remove one node and the associated edges.
- removeNode(N) - Method in class cdc.util.graphs.impl.ExtensionSubGraph
- removeNode(N) - Method in class cdc.util.graphs.impl.RestrictionSubGraph
- reset() - Method in class cdc.util.graphs.impl.RestrictionSubGraph
-
Makes the subgraph equals the underlying graph.
- RestrictionSubGraph<N,E> - Class in cdc.util.graphs.impl
-
Explicit subgraph defined by restriction.
- RestrictionSubGraph(GraphAdapter<N, E>) - Constructor for class cdc.util.graphs.impl.RestrictionSubGraph
-
Creates a full subgraph from a delegate.
S
- setEdgePredicate(Predicate<E>) - Method in class cdc.util.graphs.impl.FilteredSubGraph
- setLocked(boolean) - Method in class cdc.util.graphs.impl.BasicHeavyGraph
- setLocked(boolean) - Method in class cdc.util.graphs.impl.BasicLightGraph
- setNodePredicate(Predicate<N>) - Method in class cdc.util.graphs.impl.FilteredSubGraph
- setParent(N) - Method in class cdc.util.graphs.impl.BasicTreeNode
- setRoot(N) - Method in class cdc.util.graphs.impl.TreeAsGraph
T
- test(GraphEdge<N>) - Method in class cdc.util.graphs.impl.GraphEdgeIngoingPredicate
- test(GraphEdge<N>) - Method in class cdc.util.graphs.impl.GraphEdgeOutgoingPredicate
- toString() - Method in class cdc.util.graphs.impl.BasicGraphEdge
- toString() - Method in class cdc.util.graphs.impl.ExtensionSubGraph
- toString() - Method in class cdc.util.graphs.impl.RestrictionSubGraph
- TreeAsGraph<N> - Class in cdc.util.graphs.impl
-
Graph adapter implementation over a TreeAdapter.
- TreeAsGraph(TreeAdapter<N>) - Constructor for class cdc.util.graphs.impl.TreeAsGraph
All Classes All Packages