Package | Description |
---|---|
org.graphstream.graph | |
org.graphstream.graph.implementations | |
org.graphstream.ui.graphicGraph | |
org.graphstream.util |
Modifier and Type | Class and Description |
---|---|
class |
BreadthFirstIterator<T extends Node> |
class |
DepthFirstIterator<T extends Node> |
interface |
NodeFactory<T extends Node>
An interface aimed at dynamically creating node objects.
|
Modifier and Type | Method and Description |
---|---|
<T extends Node> |
Graph.addNode(String id)
Add a node in the graph.
|
<T extends Node> |
Node.getBreadthFirstIterator()
Iterator for breadth first exploration of the graph, starting at this
node.
|
<T extends Node> |
Node.getBreadthFirstIterator(boolean directed)
Iterator for breadth first exploration of the graph, starting at this
node.
|
<T extends Node> |
Node.getDepthFirstIterator()
Iterator for depth first exploration of the graph, starting at this node.
|
<T extends Node> |
Node.getDepthFirstIterator(boolean directed)
Iterator for depth first exploration of the graph, starting at this node.
|
<T extends Node> |
Path.getEachNode() |
<T extends Node> |
Structure.getEachNode()
Set of nodes usable in a for-each instruction.
|
<T extends Node> |
Node.getNeighborNodeIterator()
Iterator on the set of neighbor nodes connected to this node via one or
more edges.
|
<T extends Node> |
Graph.getNode(int index)
Get a node by its index.
|
<T extends Node> |
Graph.getNode(String id)
Get a node by its identifier.
|
<T extends Node> |
Edge.getNode0()
First node of the edge.
|
<T extends Node> |
Edge.getNode1()
Second node of the edge.
|
<T extends Node> |
Path.getNodeIterator() |
<T extends Node> |
Structure.getNodeIterator()
Iterator on the set of nodes, in an undefined order.
|
<T extends Node> |
Path.getNodeSet() |
<T extends Node> |
Structure.getNodeSet()
Unmodifiable view of the set of nodes.
|
<T extends Node> |
Edge.getOpposite(Node node)
When knowing one node and one edge of this node, this method return the
node at the other end of the edge.
|
<T extends Node> |
Edge.getSourceNode()
Start node.
|
<T extends Node> |
Edge.getTargetNode()
End node.
|
<T extends Node> |
Graph.removeNode(int index)
Removes a node with a given index.
|
<T extends Node> |
Graph.removeNode(Node node)
Removes a node.
|
<T extends Node> |
Graph.removeNode(String id)
Remove a node using its identifier.
|
Modifier and Type | Method and Description |
---|---|
Node |
Path.getRoot()
Get the root (the first node) of the path.
|
Node |
Path.peekNode()
Looks at the node at the top of the stack without removing it from the
stack.
|
Node |
Path.popNode()
This methods pops the 2 stacks (
edgePath and
nodePath ) and returns the removed node. |
Modifier and Type | Method and Description |
---|---|
List<Node> |
Path.getNodePath()
Construct an return a list of nodes that represents the path.
|
NodeFactory<? extends Node> |
Graph.nodeFactory()
The factory used to create node instances.
|
Modifier and Type | Method and Description |
---|---|
void |
Path.add(Node from,
Edge edge)
Method that adds a node (and an edge) to the path.
|
<T extends Edge> |
Graph.addEdge(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(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. |
boolean |
Path.contains(Node node)
Says whether the path contains this node or not.
|
int |
BreadthFirstIterator.getDepthOf(Node node) |
int |
DepthFirstIterator.getDepthOf(Node node) |
<T extends Edge> |
Node.getEdgeBetween(Node node)
Retrieves an edge between this node and and another node if one exists.
|
<T extends Edge> |
Node.getEdgeFrom(Node node)
Retrieves an edge that leaves given node toward this node.
|
<T extends Edge> |
Node.getEdgeToward(Node node)
Retrieves an edge that leaves this node toward another node.
|
<T extends Node> |
Edge.getOpposite(Node node)
When knowing one node and one edge of this node, this method return the
node at the other end of the edge.
|
boolean |
Node.hasEdgeBetween(Node node)
True if an edge exists between this node and another node.
|
boolean |
Node.hasEdgeFrom(Node node)
True if an edge enters this node from a given node.
|
boolean |
Node.hasEdgeToward(Node node)
True if an edge leaves this node toward a given node.
|
T |
EdgeFactory.newInstance(String id,
Node src,
Node dst,
boolean directed)
Create a new instance of edge.
|
void |
Path.push(Node from,
Edge edge)
A synonym for
Path.add(Edge) . |
<T extends Edge> |
Graph.removeEdge(Node node1,
Node node2)
Removes an edge between two nodes.
|
<T extends Node> |
Graph.removeNode(Node node)
Removes a node.
|
void |
Path.setRoot(Node root)
Set the root (first node) of the path.
|
boolean |
BreadthFirstIterator.tabu(Node node) |
boolean |
DepthFirstIterator.tabu(Node node) |
Modifier and Type | Method and Description |
---|---|
void |
Graph.setNodeFactory(NodeFactory<? extends Node> nf)
Set the node factory used to create nodes.
|
Constructor and Description |
---|
BreadthFirstIterator(Node startNode) |
BreadthFirstIterator(Node startNode,
boolean directed) |
DepthFirstIterator(Node startNode) |
DepthFirstIterator(Node startNode,
boolean directed) |
Modifier and Type | Class and Description |
---|---|
class |
AbstractNode
This class provides a basic implementation of
Node interface, to
minimize the effort required to implement this interface. |
class |
AdjacencyListNode
Nodes used with
AdjacencyListGraph |
class |
MultiNode
Nodes used with
MultiGraph |
class |
SingleNode
Nodes used with
SingleGraph |
Modifier and Type | Method and Description |
---|---|
<T extends Node> |
AbstractGraph.addNode(String id) |
<T extends Node> |
AbstractNode.getBreadthFirstIterator()
This implementation creates an instance of
org.graphstream.graph and returns it. |
<T extends Node> |
AbstractNode.getBreadthFirstIterator(boolean directed)
This implementation creates an instance of
org.graphstream.graph and returns it. |
<T extends Node> |
AbstractNode.getDepthFirstIterator()
This implementation creates an instance of
org.graphstream.graph and returns it. |
<T extends Node> |
AbstractNode.getDepthFirstIterator(boolean directed)
This implementation creates an instance of
org.graphstream.graph and returns it. |
<T extends Node> |
AbstractGraph.getEachNode()
This implementation uses
AbstractGraph.getNodeIterator() |
<T extends Node> |
AbstractNode.getNeighborNodeIterator()
This implementation uses
AbstractNode.getEdgeIterator() and stores the
visited nodes in a set. |
<T extends Node> |
SingleNode.getNeighborNodeIterator() |
<T extends Node> |
MultiNode.getNeighborNodeIterator() |
abstract <T extends Node> |
AbstractGraph.getNode(int index) |
<T extends Node> |
AdjacencyListGraph.getNode(int index) |
abstract <T extends Node> |
AbstractGraph.getNode(String id) |
<T extends Node> |
AdjacencyListGraph.getNode(String id) |
<T extends Node> |
AbstractEdge.getNode0() |
<T extends Node> |
AbstractEdge.getNode1() |
abstract <T extends Node> |
AbstractGraph.getNodeIterator() |
<T extends Node> |
AdjacencyListGraph.getNodeIterator() |
<T extends Node> |
AbstractGraph.getNodeSet()
This implementation uses
AbstractGraph.getNodeIterator() and
AbstractGraph.getNodeCount() |
<T extends Node> |
AbstractEdge.getOpposite(Node node) |
<T extends Node> |
AbstractEdge.getSourceNode() |
<T extends Node> |
AbstractEdge.getTargetNode() |
<T extends Node> |
AbstractGraph.removeNode(int index) |
<T extends Node> |
AbstractGraph.removeNode(Node node) |
<T extends Node> |
AbstractGraph.removeNode(String id) |
Modifier and Type | Method and Description |
---|---|
Iterator<Node> |
AbstractGraph.iterator()
This implementation returns
AbstractGraph.getNodeIterator() |
NodeFactory<? extends Node> |
AbstractGraph.nodeFactory() |
Modifier and Type | Method and Description |
---|---|
<T extends Edge> |
AbstractGraph.addEdge(String id,
Node node1,
Node node2) |
<T extends Edge> |
AbstractGraph.addEdge(String id,
Node from,
Node to,
boolean directed) |
abstract <T extends Edge> |
AbstractNode.getEdgeBetween(Node node) |
<T extends Edge> |
AdjacencyListNode.getEdgeBetween(Node node) |
abstract <T extends Edge> |
AbstractNode.getEdgeFrom(Node node) |
<T extends Edge> |
AdjacencyListNode.getEdgeFrom(Node node) |
<T extends Edge> |
MultiNode.getEdgeSetBetween(Node node) |
abstract <T extends Edge> |
AbstractNode.getEdgeToward(Node node) |
<T extends Edge> |
AdjacencyListNode.getEdgeToward(Node node) |
<T extends Node> |
AbstractEdge.getOpposite(Node node) |
boolean |
AbstractNode.hasEdgeBetween(Node node)
|
boolean |
AbstractNode.hasEdgeFrom(Node node)
|
boolean |
AbstractNode.hasEdgeToward(Node node)
|
<T extends Edge> |
AbstractGraph.removeEdge(Node node1,
Node node2) |
<T extends Node> |
AbstractGraph.removeNode(Node node) |
Modifier and Type | Method and Description |
---|---|
void |
AbstractGraph.setNodeFactory(NodeFactory<? extends Node> nf) |
Modifier and Type | Class and Description |
---|---|
class |
GraphicNode
Graphical node.
|
Modifier and Type | Method and Description |
---|---|
<T extends Node> |
GraphicGraph.addNode(String id) |
<T extends Node> |
GraphicGraph.getNode(int index) |
<T extends Node> |
GraphicGraph.getNode(String id) |
<T extends Node> |
GraphicEdge.getNode0() |
<T extends Node> |
GraphicEdge.getNode1() |
<T extends Node> |
GraphicGraph.getNodeIterator() |
<T extends Node> |
GraphicGraph.getNodeSet() |
<T extends Node> |
GraphicEdge.getOpposite(Node node) |
<T extends Node> |
GraphicEdge.getSourceNode() |
<T extends Node> |
GraphicEdge.getTargetNode() |
<T extends Node> |
GraphicGraph.removeNode(int index) |
<T extends Node> |
GraphicGraph.removeNode(Node node) |
<T extends Node> |
GraphicGraph.removeNode(String id) |
Modifier and Type | Method and Description |
---|---|
Node |
StyleGroupSet.getNode(String id)
Get a node element knowing its identifier.
|
Modifier and Type | Method and Description |
---|---|
Iterator<Node> |
GraphicNode.getBreadthFirstIterator()
Not implemented.
|
Iterator<Node> |
GraphicNode.getBreadthFirstIterator(boolean directed)
Not implemented.
|
Iterator<Node> |
GraphicNode.getDepthFirstIterator()
Not implemented.
|
Iterator<Node> |
GraphicNode.getDepthFirstIterator(boolean directed)
Not implemented.
|
Iterable<? extends Node> |
GraphicGraph.getEachNode() |
Iterator<Node> |
GraphicNode.getNeighborNodeIterator() |
Iterator<? extends Node> |
StyleGroupSet.getNodeIterator()
Iterator on the set of nodes.
|
Iterator<Node> |
GraphicGraph.iterator() |
NodeFactory<? extends Node> |
GraphicGraph.nodeFactory() |
Iterable<? extends Node> |
StyleGroupSet.nodes()
Iterable set of nodes.
|
Modifier and Type | Method and Description |
---|---|
<T extends Edge> |
GraphicGraph.addEdge(String id,
Node node1,
Node node2) |
<T extends Edge> |
GraphicGraph.addEdge(String id,
Node from,
Node to,
boolean directed) |
<T extends Edge> |
GraphicNode.getEdgeBetween(Node Node) |
<T extends Edge> |
GraphicNode.getEdgeFrom(Node Node) |
<T extends Edge> |
GraphicNode.getEdgeToward(Node Node) |
<T extends Node> |
GraphicEdge.getOpposite(Node node) |
StyleGroup |
StyleGroupSet.getStyleFor(Node node)
Get the style of a given node.
|
boolean |
GraphicNode.hasEdgeBetween(Node node) |
boolean |
GraphicNode.hasEdgeFrom(Node node) |
boolean |
GraphicNode.hasEdgeToward(Node node) |
static Point3 |
GraphPosLengthUtils.nodePointPosition(Node node)
Like
GraphPosLengthUtils.nodePointPosition(Graph,String) but use an existing node as
argument. |
static double[] |
GraphPosLengthUtils.nodePosition(Node node)
Like
GraphPosLengthUtils.nodePosition(Graph,String) but use an existing node as
argument. |
static void |
GraphPosLengthUtils.nodePosition(Node node,
double[] xyz)
Like
GraphPosLengthUtils.nodePosition(Graph,String,double[]) but use an existing node
as argument. |
static void |
GraphPosLengthUtils.nodePosition(Node node,
Point3 pos)
Like
GraphPosLengthUtils.nodePosition(Graph,String,Point3) but use an existing node
as argument. |
<T extends Edge> |
GraphicGraph.removeEdge(Node node1,
Node node2) |
<T extends Node> |
GraphicGraph.removeNode(Node node) |
Modifier and Type | Method and Description |
---|---|
void |
GraphicGraph.setNodeFactory(NodeFactory<? extends Node> nf) |
Modifier and Type | Class and Description |
---|---|
class |
FilteredNodeIterator<T extends Node> |
Constructor and Description |
---|
FilteredNodeIterator(Graph g,
Filter<Node> filter) |
FilteredNodeIterator(Iterator<T> ite,
Filter<Node> filter) |
Copyright © 2015. All rights reserved.