Package | Description |
---|---|
org.graphstream.graph | |
org.graphstream.graph.implementations | |
org.graphstream.util |
Modifier and Type | Interface and Description |
---|---|
interface |
EdgeFactory<T extends Edge>
An interface aimed at dynamically creating edge objects.
|
Modifier and Type | Field and Description |
---|---|
(package private) java.util.Stack<Edge> |
Path.edgePath
The list of edges that represents the path.
|
Modifier and Type | Method and Description |
---|---|
<T extends Edge> |
Graph.addEdge(java.lang.String id,
int index1,
int index2)
Like
Graph.addEdge(String, String, String) but the nodes are
identified by their indices. |
<T extends Edge> |
Graph.addEdge(java.lang.String id,
int fromIndex,
int toIndex,
boolean directed)
Like
Graph.addEdge(String, String, String, boolean) but the nodes are
identified by their indices. |
<T extends Edge> |
Graph.addEdge(java.lang.String id,
Node node1,
Node node2)
Like
Graph.addEdge(String, String, String) but the node references are
given instead of node identifiers. |
<T extends Edge> |
Graph.addEdge(java.lang.String id,
Node from,
Node to,
boolean directed)
Like
Graph.addEdge(String, String, String, boolean) but the node
references are given instead of node identifiers. |
<T extends Edge> |
Graph.addEdge(java.lang.String id,
java.lang.String node1,
java.lang.String node2)
Adds an undirected edge between nodes.
|
<T extends Edge> |
Graph.addEdge(java.lang.String id,
java.lang.String from,
java.lang.String to,
boolean directed)
Like
Graph.addEdge(String, String, String) , but this edge can be
directed between the two given nodes. |
<T extends Edge> |
Structure.getEachEdge()
Set of edges usable in a for-each instruction.
|
<T extends Edge> |
Path.getEachEdge() |
<T extends Edge> |
Node.getEachEdge()
Set of all entering and leaving edges.
|
<T extends Edge> |
Node.getEachEnteringEdge()
Set of all entering edges.
|
<T extends Edge> |
Node.getEachLeavingEdge()
Set of all leaving edges.
|
<T extends Edge> |
Node.getEdge(int i)
I-th edge.
|
<T extends Edge> |
Graph.getEdge(int index)
Get an edge by its index.
|
<T extends Edge> |
Graph.getEdge(java.lang.String id)
Get an edge by its identifier.
|
<T extends Edge> |
Node.getEdgeBetween(int index)
Retrieves an edge between this node and the node with index i if one
exists.
|
<T extends Edge> |
Node.getEdgeBetween(Node node)
Retrieves an edge between this node and and another node if one exists.
|
<T extends Edge> |
Node.getEdgeBetween(java.lang.String id)
Retrieve an edge between this node and the node 'id', if it exits.
|
<T extends Edge> |
Node.getEdgeFrom(int index)
Retrieves an edge that leaves node with given index toward this node.
|
<T extends Edge> |
Node.getEdgeFrom(Node node)
Retrieves an edge that leaves given node toward this node.
|
<T extends Edge> |
Node.getEdgeFrom(java.lang.String id)
Retrieve an edge that leaves node 'id' toward this node.
|
<T extends Edge> |
Structure.getEdgeIterator()
Iterator on the set of edges, in an undefined order.
|
<T extends Edge> |
Path.getEdgeIterator() |
<T extends Edge> |
Node.getEdgeIterator()
Iterator on the set of connected edges.
|
<T extends Edge> |
Structure.getEdgeSet()
Unmodifiable view of the set of edges.
|
<T extends Edge> |
Path.getEdgeSet() |
<T extends Edge> |
Node.getEdgeSet()
Set of all entering and leaving edges.
|
<T extends Edge> |
Node.getEdgeToward(int index)
Retrieves an edge that leaves this node toward the node with given index.
|
<T extends Edge> |
Node.getEdgeToward(Node node)
Retrieves an edge that leaves this node toward another node.
|
<T extends Edge> |
Node.getEdgeToward(java.lang.String id)
Retrieve an edge that leaves this node toward 'id'.
|
<T extends Edge> |
Node.getEnteringEdge(int i)
I-th entering edge.
|
<T extends Edge> |
Node.getEnteringEdgeIterator()
Iterator only on leaving edges.
|
<T extends Edge> |
Node.getEnteringEdgeSet()
Set of all entering edges.
|
<T extends Edge> |
Node.getLeavingEdge(int i)
I-th leaving edge.
|
<T extends Edge> |
Node.getLeavingEdgeIterator()
Iterator only on entering edges.
|
<T extends Edge> |
Node.getLeavingEdgeSet()
Set of all leaving edges.
|
<T extends Edge> |
Graph.removeEdge(Edge edge)
Removes an edge.
|
<T extends Edge> |
Graph.removeEdge(int index)
Removes an edge with a given index.
|
<T extends Edge> |
Graph.removeEdge(int fromIndex,
int toIndex)
Removes an edge between two nodes.
|
<T extends Edge> |
Graph.removeEdge(Node node1,
Node node2)
Removes an edge between two nodes.
|
<T extends Edge> |
Graph.removeEdge(java.lang.String id)
Removes an edge knowing its identifier.
|
<T extends Edge> |
Graph.removeEdge(java.lang.String from,
java.lang.String to)
Remove an edge given the identifiers of its two endpoints.
|
Modifier and Type | Method and Description |
---|---|
Edge |
Path.peekEdge()
Looks at the edge at the top of the stack without removing it from the
stack.
|
Edge |
Path.popEdge()
This methods pops the 2 stacks (
edgePath and
nodePath ) and returns the removed edge. |
Modifier and Type | Method and Description |
---|---|
EdgeFactory<? extends Edge> |
Graph.edgeFactory()
The factory used to create edge instances.
|
java.util.List<Edge> |
Path.getEdgePath()
Returns the list of edges representing the path.
|
Modifier and Type | Method and Description |
---|---|
void |
Path.add(Edge edge)
Method that adds an edge an a node to the path.
|
void |
Path.add(Node from,
Edge edge)
Method that adds a node (and an edge) to the path.
|
boolean |
Path.contains(Edge edge)
Says whether the path contains this edge or not.
|
void |
Path.push(Edge edge)
A synonym for
Path.add(Edge) . |
void |
Path.push(Node from,
Edge edge)
A synonym for
Path.add(Edge) . |
<T extends Edge> |
Graph.removeEdge(Edge edge)
Removes an edge.
|
Modifier and Type | Method and Description |
---|---|
void |
Graph.setEdgeFactory(EdgeFactory<? extends Edge> ef)
Set the edge factory used to create edges.
|
Modifier and Type | Class and Description |
---|---|
protected class |
AdjacencyListGraph.EdgeIterator<T extends Edge> |
protected class |
AdjacencyListNode.EdgeIterator<T extends Edge> |
Modifier and Type | Class and Description |
---|---|
class |
AbstractEdge
This class provides a basic implementation of
Edge interface, to
minimize the effort required to implement this interface. |
(package private) static class |
Graphs.SynchronizedEdge |
Modifier and Type | Field and Description |
---|---|
(package private) java.util.HashMap<java.lang.String,Edge> |
Graphs.SynchronizedGraph.synchronizedEdges |
Modifier and Type | Method and Description |
---|---|
protected <T extends Edge> |
AbstractGraph.addEdge_(java.lang.String sourceId,
long timeId,
java.lang.String edgeId,
AbstractNode src,
java.lang.String srcId,
AbstractNode dst,
java.lang.String dstId,
boolean directed) |
<T extends Edge> |
Graphs.SynchronizedGraph.addEdge(java.lang.String id,
int index1,
int index2) |
<T extends Edge> |
AbstractGraph.addEdge(java.lang.String id,
int index1,
int index2) |
<T extends Edge> |
Graphs.SynchronizedGraph.addEdge(java.lang.String id,
int fromIndex,
int toIndex,
boolean directed) |
<T extends Edge> |
AbstractGraph.addEdge(java.lang.String id,
int fromIndex,
int toIndex,
boolean directed) |
<T extends Edge> |
Graphs.SynchronizedGraph.addEdge(java.lang.String id,
Node node1,
Node node2) |
<T extends Edge> |
AbstractGraph.addEdge(java.lang.String id,
Node node1,
Node node2) |
<T extends Edge> |
Graphs.SynchronizedGraph.addEdge(java.lang.String id,
Node from,
Node to,
boolean directed) |
<T extends Edge> |
AbstractGraph.addEdge(java.lang.String id,
Node from,
Node to,
boolean directed) |
<T extends Edge> |
Graphs.SynchronizedGraph.addEdge(java.lang.String id,
java.lang.String node1,
java.lang.String node2) |
<T extends Edge> |
AbstractGraph.addEdge(java.lang.String id,
java.lang.String node1,
java.lang.String node2) |
<T extends Edge> |
Graphs.SynchronizedGraph.addEdge(java.lang.String id,
java.lang.String from,
java.lang.String to,
boolean directed) |
<T extends Edge> |
AbstractGraph.addEdge(java.lang.String id,
java.lang.String from,
java.lang.String to,
boolean directed) |
<T extends Edge> |
AbstractNode.getEachEdge()
This implementation uses
AbstractNode.getEdgeIterator() |
<T extends Edge> |
AbstractGraph.getEachEdge()
This implementation uses
AbstractGraph.getEdgeIterator() |
<T extends Edge> |
AbstractNode.getEachEnteringEdge()
This implementation uses
AbstractNode.getEnteringEdgeIterator() |
<T extends Edge> |
AbstractNode.getEachLeavingEdge()
This implementation uses
AbstractNode.getLeavingEdgeIterator() |
<T extends Edge> |
Graphs.SynchronizedGraph.getEdge(int index) |
<T extends Edge> |
Graphs.SynchronizedNode.getEdge(int i) |
<T extends Edge> |
AdjacencyListNode.getEdge(int i) |
<T extends Edge> |
AdjacencyListGraph.getEdge(int index) |
abstract <T extends Edge> |
AbstractNode.getEdge(int i) |
abstract <T extends Edge> |
AbstractGraph.getEdge(int index) |
<T extends Edge> |
Graphs.SynchronizedGraph.getEdge(java.lang.String id) |
<T extends Edge> |
AdjacencyListGraph.getEdge(java.lang.String id) |
abstract <T extends Edge> |
AbstractGraph.getEdge(java.lang.String id) |
<T extends Edge> |
Graphs.SynchronizedNode.getEdgeBetween(int index) |
<T extends Edge> |
AbstractNode.getEdgeBetween(int index)
This implementation uses
AbstractNode.getEdgeBetween(Node) |
<T extends Edge> |
Graphs.SynchronizedNode.getEdgeBetween(Node n) |
<T extends Edge> |
AdjacencyListNode.getEdgeBetween(Node node) |
abstract <T extends Edge> |
AbstractNode.getEdgeBetween(Node node) |
<T extends Edge> |
Graphs.SynchronizedNode.getEdgeBetween(java.lang.String id) |
<T extends Edge> |
AbstractNode.getEdgeBetween(java.lang.String id)
This implementation uses
AbstractNode.getEdgeBetween(Node) |
<T extends Edge> |
Graphs.SynchronizedNode.getEdgeFrom(int index) |
<T extends Edge> |
AbstractNode.getEdgeFrom(int index)
This implementation uses
AbstractNode.getEdgeFrom(Node) |
<T extends Edge> |
Graphs.SynchronizedNode.getEdgeFrom(Node n) |
<T extends Edge> |
AdjacencyListNode.getEdgeFrom(Node node) |
abstract <T extends Edge> |
AbstractNode.getEdgeFrom(Node node) |
<T extends Edge> |
Graphs.SynchronizedNode.getEdgeFrom(java.lang.String id) |
<T extends Edge> |
AbstractNode.getEdgeFrom(java.lang.String id)
This implementation uses
AbstractNode.getEdgeFrom(Node) |
<T extends Edge> |
AdjacencyListNode.getEdgeIterator() |
<T extends Edge> |
AdjacencyListGraph.getEdgeIterator() |
abstract <T extends Edge> |
AbstractNode.getEdgeIterator() |
abstract <T extends Edge> |
AbstractGraph.getEdgeIterator() |
<T extends Edge> |
AbstractNode.getEdgeSet()
This implementation uses
AbstractNode.getEdgeIterator() and
AbstractNode.getDegree() |
<T extends Edge> |
AbstractGraph.getEdgeSet()
This implementation uses
AbstractGraph.getEdgeIterator() and
AbstractGraph.getEdgeCount() |
<T extends Edge> |
MultiNode.getEdgeSetBetween(int index) |
<T extends Edge> |
MultiNode.getEdgeSetBetween(Node node) |
<T extends Edge> |
MultiNode.getEdgeSetBetween(java.lang.String id) |
<T extends Edge> |
Graphs.SynchronizedNode.getEdgeToward(int index) |
<T extends Edge> |
AbstractNode.getEdgeToward(int index)
This implementation uses
AbstractNode.getEdgeToward(Node) |
<T extends Edge> |
Graphs.SynchronizedNode.getEdgeToward(Node n) |
<T extends Edge> |
AdjacencyListNode.getEdgeToward(Node node) |
abstract <T extends Edge> |
AbstractNode.getEdgeToward(Node node) |
<T extends Edge> |
Graphs.SynchronizedNode.getEdgeToward(java.lang.String id) |
<T extends Edge> |
AbstractNode.getEdgeToward(java.lang.String id)
This implementation uses
AbstractNode.getEdgeToward(Node) |
<T extends Edge> |
Graphs.SynchronizedNode.getEnteringEdge(int i) |
<T extends Edge> |
AdjacencyListNode.getEnteringEdge(int i) |
abstract <T extends Edge> |
AbstractNode.getEnteringEdge(int i) |
<T extends Edge> |
AdjacencyListNode.getEnteringEdgeIterator() |
abstract <T extends Edge> |
AbstractNode.getEnteringEdgeIterator() |
<T extends Edge> |
AbstractNode.getEnteringEdgeSet()
This implementation uses
AbstractNode.getEnteringEdgeIterator() and
#geIntDegree() |
<T extends Edge> |
Graphs.SynchronizedNode.getLeavingEdge(int i) |
<T extends Edge> |
AdjacencyListNode.getLeavingEdge(int i) |
abstract <T extends Edge> |
AbstractNode.getLeavingEdge(int i) |
<T extends Edge> |
AdjacencyListNode.getLeavingEdgeIterator() |
abstract <T extends Edge> |
AbstractNode.getLeavingEdgeIterator() |
<T extends Edge> |
AbstractNode.getLeavingEdgeSet()
This implementation uses
#getLeavingIterator() and
#geOuttDegree() |
protected <T extends Edge> |
SingleNode.locateEdge(Node opposite,
char type) |
protected <T extends Edge> |
MultiNode.locateEdge(Node opposite,
char type) |
protected <T extends Edge> |
AdjacencyListNode.locateEdge(Node opposite,
char type) |
protected <T extends Edge> |
AbstractGraph.removeEdge_(java.lang.String sourceId,
long timeId,
AbstractEdge edge,
java.lang.String edgeId,
boolean graphCallback,
boolean srcCallback,
boolean dstCallback) |
<T extends Edge> |
Graphs.SynchronizedGraph.removeEdge(Edge edge) |
<T extends Edge> |
AbstractGraph.removeEdge(Edge edge) |
<T extends Edge> |
Graphs.SynchronizedGraph.removeEdge(int index) |
<T extends Edge> |
AbstractGraph.removeEdge(int index) |
<T extends Edge> |
Graphs.SynchronizedGraph.removeEdge(int fromIndex,
int toIndex) |
<T extends Edge> |
AbstractGraph.removeEdge(int fromIndex,
int toIndex) |
<T extends Edge> |
Graphs.SynchronizedGraph.removeEdge(Node node1,
Node node2) |
<T extends Edge> |
AbstractGraph.removeEdge(Node node1,
Node node2) |
<T extends Edge> |
Graphs.SynchronizedGraph.removeEdge(java.lang.String id) |
<T extends Edge> |
AbstractGraph.removeEdge(java.lang.String id) |
<T extends Edge> |
Graphs.SynchronizedGraph.removeEdge(java.lang.String from,
java.lang.String to) |
<T extends Edge> |
AbstractGraph.removeEdge(java.lang.String from,
java.lang.String to) |
Modifier and Type | Method and Description |
---|---|
EdgeFactory<? extends Edge> |
Graphs.SynchronizedGraph.edgeFactory() |
EdgeFactory<? extends Edge> |
AbstractGraph.edgeFactory() |
java.lang.Iterable<Edge> |
Graphs.SynchronizedGraph.getEachEdge() |
java.lang.Iterable<Edge> |
Graphs.SynchronizedNode.getEachEdge() |
java.lang.Iterable<Edge> |
Graphs.SynchronizedNode.getEachEnteringEdge() |
java.lang.Iterable<Edge> |
Graphs.SynchronizedNode.getEachLeavingEdge() |
java.util.Iterator<Edge> |
Graphs.SynchronizedGraph.getEdgeIterator() |
java.util.Iterator<Edge> |
Graphs.SynchronizedNode.getEdgeIterator() |
java.util.Collection<Edge> |
Graphs.SynchronizedGraph.getEdgeSet() |
java.util.Collection<Edge> |
Graphs.SynchronizedNode.getEdgeSet() |
java.util.Iterator<Edge> |
Graphs.SynchronizedNode.getEnteringEdgeIterator() |
java.util.Collection<Edge> |
Graphs.SynchronizedNode.getEnteringEdgeSet() |
java.util.Iterator<Edge> |
Graphs.SynchronizedNode.getLeavingEdgeIterator() |
java.util.Collection<Edge> |
Graphs.SynchronizedNode.getLeavingEdgeSet() |
java.util.Iterator<Edge> |
Graphs.SynchronizedNode.iterator() |
java.util.Iterator<Edge> |
AbstractNode.iterator()
This implementation uses
AbstractNode.getEdgeIterator() |
Modifier and Type | Method and Description |
---|---|
boolean |
AbstractNode.isEnteringEdge(Edge e)
Checks if an edge enters this node.
|
boolean |
AbstractNode.isIncidentEdge(Edge e)
Checks if an edge is incident to this node.
|
boolean |
AbstractNode.isLeavingEdge(Edge e)
Checks if an edge leaves this node.
|
<T extends Edge> |
Graphs.SynchronizedGraph.removeEdge(Edge edge) |
<T extends Edge> |
AbstractGraph.removeEdge(Edge edge) |
Modifier and Type | Method and Description |
---|---|
void |
Graphs.SynchronizedGraph.setEdgeFactory(EdgeFactory<? extends Edge> ef) |
void |
AbstractGraph.setEdgeFactory(EdgeFactory<? extends Edge> ef) |
Constructor and Description |
---|
Graphs.SynchronizedEdge(Graphs.SynchronizedGraph sg,
Edge e) |
Modifier and Type | Class and Description |
---|---|
class |
FilteredEdgeIterator<T extends Edge> |
Modifier and Type | Field and Description |
---|---|
protected T |
FilteredEdgeIterator.next |
Modifier and Type | Field and Description |
---|---|
protected Filter<Edge> |
FilteredEdgeIterator.filter |
Constructor and Description |
---|
FilteredEdgeIterator(Graph g,
Filter<Edge> filter) |
FilteredEdgeIterator(java.util.Iterator<T> ite,
Filter<Edge> filter) |