| Package | Description | 
|---|---|
| org.graphstream.graph | |
| org.graphstream.graph.implementations | |
| org.graphstream.ui.graphicGraph | 
| Modifier and Type | Interface and Description | 
|---|---|
interface  | 
NodeFactory<T extends Node>
An interface aimed at dynamically creating node objects. 
 | 
| Modifier and Type | Method and Description | 
|---|---|
<T extends Node> | 
Path.getNodeSet()  | 
| Modifier and Type | Method and Description | 
|---|---|
Node | 
Graph.addNode(java.lang.String id)
Add a node in the graph. 
 | 
Node | 
Graph.getNode(int index)
Get a node by its index. 
 | 
Node | 
Graph.getNode(java.lang.String id)
Get a node by its identifier. 
 | 
Node | 
Edge.getNode0()
First node of the edge. 
 | 
Node | 
Edge.getNode1()
Second node of the edge. 
 | 
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. 
 | 
Node | 
Path.getRoot()
Get the root (the first node) of the path. 
 | 
Node | 
Edge.getSourceNode()
Start node. 
 | 
Node | 
Edge.getTargetNode()
End node. 
 | 
Node | 
BreadthFirstIterator.next()  | 
Node | 
DepthFirstIterator.next()  | 
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. | 
default Node | 
Graph.removeNode(int index)
Removes a node with a given index. 
 | 
Node | 
Graph.removeNode(Node node)
Removes a node. 
 | 
default Node | 
Graph.removeNode(java.lang.String id)
Remove a node using its identifier. 
 | 
| Modifier and Type | Method and Description | 
|---|---|
java.util.Iterator<Node> | 
Node.getBreadthFirstIterator()
Iterator for breadth first exploration of the graph, starting at this node. 
 | 
java.util.Iterator<Node> | 
Node.getBreadthFirstIterator(boolean directed)
Iterator for breadth first exploration of the graph, starting at this node. 
 | 
java.util.Iterator<Node> | 
Node.getDepthFirstIterator()
Iterator for depth first exploration of the graph, starting at this node. 
 | 
java.util.Iterator<Node> | 
Node.getDepthFirstIterator(boolean directed)
Iterator for depth first exploration of the graph, starting at this node. 
 | 
java.util.List<Node> | 
Path.getNodePath()
Construct an return a list of nodes that represents the path. 
 | 
default java.util.stream.Stream<Node> | 
Node.neighborNodes()
Stream over neighbor nodes connected to this node via one or more edges. 
 | 
NodeFactory<? extends Node> | 
Graph.nodeFactory()
The factory used to create node instances. 
 | 
java.util.stream.Stream<Node> | 
Path.nodes()  | 
java.util.stream.Stream<Node> | 
Structure.nodes()  | 
| Modifier and Type | Method and Description | 
|---|---|
void | 
Path.add(Node from,
   Edge edge)
Adds a node and an edge to the path. 
 | 
default 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. | 
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. | 
boolean | 
Path.contains(Node node)
Says whether the path contains this node or not. 
 | 
int | 
BreadthFirstIterator.getDepthOf(Node node)  | 
int | 
DepthFirstIterator.getDepthOf(Node node)  | 
Edge | 
Node.getEdgeBetween(Node node)
Retrieves an edge between this node and and another node if one exists. 
 | 
Edge | 
Node.getEdgeFrom(Node node)
Retrieves an edge that leaves given node toward this node. 
 | 
Edge | 
Node.getEdgeToward(Node node)
Retrieves an edge that leaves this node toward another node. 
 | 
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. 
 | 
default boolean | 
Node.hasEdgeBetween(Node node)
True if an edge exists between this node and another node. 
 | 
default boolean | 
Node.hasEdgeFrom(Node node)
True if an edge enters this node from a given node. 
 | 
default boolean | 
Node.hasEdgeToward(Node node)
True if an edge leaves this node toward a given node. 
 | 
T | 
EdgeFactory.newInstance(java.lang.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). | 
Edge | 
Graph.removeEdge(Node node1,
          Node node2)
Removes an edge between two nodes. 
 | 
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 | 
|---|---|
Node | 
AbstractGraph.addNode(java.lang.String id)  | 
Node | 
AdjacencyListGraph.getNode(int index)  | 
Node | 
AdjacencyListGraph.getNode(java.lang.String id)  | 
Node | 
AbstractEdge.getNode0()  | 
Node | 
AbstractEdge.getNode1()  | 
Node | 
AbstractEdge.getOpposite(Node node)  | 
Node | 
AbstractEdge.getSourceNode()  | 
Node | 
AbstractEdge.getTargetNode()  | 
Node | 
AbstractGraph.removeNode(Node node)  | 
| Modifier and Type | Method and Description | 
|---|---|
java.util.Iterator<Node> | 
AbstractNode.getBreadthFirstIterator()
This implementation creates an instance of
  
BreadthFirstIterator and returns it. | 
java.util.Iterator<Node> | 
AbstractNode.getBreadthFirstIterator(boolean directed)
This implementation creates an instance of
  
BreadthFirstIterator and returns it. | 
java.util.Iterator<Node> | 
AbstractNode.getDepthFirstIterator()
This implementation creates an instance of
  
DepthFirstIterator and returns it. | 
java.util.Iterator<Node> | 
AbstractNode.getDepthFirstIterator(boolean directed)
This implementation creates an instance of
  
DepthFirstIterator and returns it. | 
java.util.Iterator<Node> | 
AbstractGraph.iterator()
This implementation returns an iterator over nodes. 
 | 
NodeFactory<? extends Node> | 
AbstractGraph.nodeFactory()  | 
java.util.stream.Stream<Node> | 
AdjacencyListGraph.nodes()  | 
| Modifier and Type | Method and Description | 
|---|---|
Edge | 
AbstractGraph.addEdge(java.lang.String id,
       Node from,
       Node to,
       boolean directed)  | 
Edge | 
AdjacencyListNode.getEdgeBetween(Node node)  | 
Edge | 
AdjacencyListNode.getEdgeFrom(Node node)  | 
<T extends Edge> | 
MultiNode.getEdgeSetBetween(Node node)  | 
Edge | 
AdjacencyListNode.getEdgeToward(Node node)  | 
Node | 
AbstractEdge.getOpposite(Node node)  | 
Edge | 
AbstractGraph.removeEdge(Node node1,
          Node node2)  | 
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 | 
|---|---|
Node | 
GraphicGraph.addNode(java.lang.String id)  | 
Node | 
GraphicGraph.getNode(int index)  | 
Node | 
StyleGroupSet.getNode(java.lang.String id)
Get a node element knowing its identifier. 
 | 
Node | 
GraphicGraph.getNode(java.lang.String id)  | 
Node | 
GraphicEdge.getNode0()  | 
Node | 
GraphicEdge.getNode1()  | 
Node | 
GraphicEdge.getOpposite(Node node)  | 
Node | 
GraphicEdge.getSourceNode()  | 
Node | 
GraphicEdge.getTargetNode()  | 
Node | 
GraphicGraph.removeNode(int index)  | 
Node | 
GraphicGraph.removeNode(Node node)  | 
Node | 
GraphicGraph.removeNode(java.lang.String id)  | 
| Modifier and Type | Method and Description | 
|---|---|
java.util.Iterator<Node> | 
GraphicNode.getBreadthFirstIterator()
Not implemented. 
 | 
java.util.Iterator<Node> | 
GraphicNode.getBreadthFirstIterator(boolean directed)
Not implemented. 
 | 
java.util.Iterator<Node> | 
GraphicNode.getDepthFirstIterator()
Not implemented. 
 | 
java.util.Iterator<Node> | 
GraphicNode.getDepthFirstIterator(boolean directed)
Not implemented. 
 | 
java.util.Iterator<? extends Node> | 
StyleGroupSet.getNodeIterator()
Iterator on the set of nodes. 
 | 
java.util.Iterator<Node> | 
GraphicGraph.iterator()  | 
NodeFactory<? extends Node> | 
GraphicGraph.nodeFactory()  | 
java.util.stream.Stream<Node> | 
StyleGroupSet.nodes()  | 
java.util.stream.Stream<Node> | 
GraphicGraph.nodes()  | 
| Modifier and Type | Method and Description | 
|---|---|
Edge | 
GraphicGraph.addEdge(java.lang.String id,
       Node node1,
       Node node2)  | 
Edge | 
GraphicGraph.addEdge(java.lang.String id,
       Node from,
       Node to,
       boolean directed)  | 
Edge | 
GraphicNode.getEdgeBetween(Node Node)  | 
Edge | 
GraphicNode.getEdgeFrom(Node Node)  | 
Edge | 
GraphicNode.getEdgeToward(Node Node)  | 
Node | 
GraphicEdge.getOpposite(Node node)  | 
StyleGroup | 
StyleGroupSet.getStyleFor(Node node)
Get the style of a given 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 Point3 | 
GraphPosLengthUtils.nodePosition(Node node,
            Point3 pos)
Like  
GraphPosLengthUtils.nodePosition(Graph,String,Point3) but use an existing node as
 argument. | 
Edge | 
GraphicGraph.removeEdge(Node node1,
          Node node2)  | 
Node | 
GraphicGraph.removeNode(Node node)  | 
| Modifier and Type | Method and Description | 
|---|---|
void | 
GraphicGraph.setNodeFactory(NodeFactory<? extends Node> nf)  |