Package | Description |
---|---|
org.thegalactic.dgraph |
This package is designed to represent directed graph.
|
org.thegalactic.lattice |
This package is designed to represent lattice.
|
Modifier and Type | Method and Description |
---|---|
Edge<N,E> |
ConcreteDGraph.getEdge(Node<N> source,
Node<N> target)
Returns, if it exists, the edge between node source and node to.
|
Edge<N,E> |
Edge.setContent(E content)
Replaces the content of this edge with the specified one.
|
Modifier and Type | Method and Description |
---|---|
SortedSet<Edge<N,E>> |
DGraph.getEdges()
Returns the set of edges of this component.
|
SortedSet<Edge<N,E>> |
ConcreteDGraph.getEdges()
Returns the set of edges of this component.
|
SortedSet<Edge<N,E>> |
DGraph.getPredecessorEdges(Node<N> node)
Returns the set of edges predecessors of the specified node.
|
SortedSet<Edge<N,E>> |
ConcreteDGraph.getPredecessorEdges(Node<N> node)
Returns the set of edges predecessors of the specified node.
|
protected TreeMap<Node<N>,TreeSet<Edge<N,E>>> |
ConcreteDGraph.getPredecessors()
Returns the predecessors of this component.
|
SortedSet<Edge<N,E>> |
DGraph.getSuccessorEdges(Node<N> node)
Returns the set of edges successors of the specified node.
|
SortedSet<Edge<N,E>> |
ConcreteDGraph.getSuccessorEdges(Node<N> node)
Returns the set of edges successors of the specified node.
|
protected TreeMap<Node<N>,TreeSet<Edge<N,E>>> |
ConcreteDGraph.getSuccessors()
Returns the successors of this component.
|
Modifier and Type | Method and Description |
---|---|
boolean |
ConcreteDGraph.addEdge(Edge<N,E> edge)
Adds the specified edge to this component in the successors of edge.getSource() and in the predecessors of edge.getTarget().
|
int |
Edge.compareTo(Edge<N,E> edge)
Compares this edge with those in parameter, based on their identifiers.
|
boolean |
ConcreteDGraph.containsEdge(Edge<N,E> edge)
Checks if the specified edge belong to this component.
|
boolean |
ConcreteDGraph.removeEdge(Edge<N,E> edge)
Removes source this component the specified edge source the successors of edge.getSource() and source the predecessors of edge.getTarget().
|
Modifier and Type | Method and Description |
---|---|
ConcreteDGraph<N,E> |
ConcreteDGraph.getSubgraphByEdges(Set<Edge<N,E>> edges)
Returns the subgraph of this component induced by the specified set of edges.
|
protected ConcreteDGraph<N,E> |
ConcreteDGraph.setPredecessors(TreeMap<Node<N>,TreeSet<Edge<N,E>>> predecessors)
Set the predecessors of this component.
|
protected ConcreteDGraph<N,E> |
ConcreteDGraph.setSuccessors(TreeMap<Node<N>,TreeSet<Edge<N,E>>> successors)
Set the successors of this component.
|
Modifier and Type | Method and Description |
---|---|
boolean |
ArrowRelation.isCirc(Edge edge)
Returns true if and only if there is an circ arrow between the source and the target of edge e.
|
boolean |
ArrowRelation.isCross(Edge edge)
Returns true if and only if there is an cross arrow between the source and the target of edge e.
|
boolean |
ArrowRelation.isDown(Edge edge)
Returns true if and only if there is an down arrow between the source and the target of edge e.
|
boolean |
ArrowRelation.isUp(Edge edge)
Returns true if and only if there is an up arrow between the source and the target of edge e.
|
boolean |
ArrowRelation.isUpDown(Edge edge)
Returns true if and only if there is an up-down arrow between the source and the target of edge e.
|
Copyright © 2010–2016 The Galactic Organization. All rights reserved.