Uses of Interface
org.graphstream.graph.Node

Packages that use Node

Package	Description
org.graphstream.graph
org.graphstream.graph.implementations
org.graphstream.util

Uses of Node in org.graphstream.graph

Classes in org.graphstream.graph with type parameters of type Node

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.

Fields in org.graphstream.graph declared as Node

Modifier and Type	Field and Description
(package private) Node	DepthFirstIterator.next
(package private) Node[]	DepthFirstIterator.parent
protected Node[]	BreadthFirstIterator.queue
private Node	Path.root The root of the path;

Fields in org.graphstream.graph with type parameters of type Node

Modifier and Type	Field and Description
(package private) java.util.Stack<Node>	Path.nodePath The list of nodes representing the path.

Methods in org.graphstream.graph with type parameters of type Node

Modifier and Type	Method and Description
<T extends Node> T	Graph.addNode(java.lang.String id) Add a node in the graph.
<T extends Node> java.util.Iterator<T>	Node.getBreadthFirstIterator() Iterator for breadth first exploration of the graph, starting at this node.
<T extends Node> java.util.Iterator<T>	Node.getBreadthFirstIterator(boolean directed) Iterator for breadth first exploration of the graph, starting at this node.
<T extends Node> java.util.Iterator<T>	Node.getDepthFirstIterator() Iterator for depth first exploration of the graph, starting at this node.
<T extends Node> java.util.Iterator<T>	Node.getDepthFirstIterator(boolean directed) Iterator for depth first exploration of the graph, starting at this node.
<T extends Node> java.lang.Iterable<? extends T>	Structure.getEachNode() Set of nodes usable in a for-each instruction.
<T extends Node> java.lang.Iterable<? extends T>	Path.getEachNode()
<T extends Node> java.util.Iterator<T>	Node.getNeighborNodeIterator() Iterator on the set of neighbor nodes connected to this node via one or more edges.
<T extends Node> T	Graph.getNode(int index) Get a node by its index.
<T extends Node> T	Graph.getNode(java.lang.String id) Get a node by its identifier.
<T extends Node> T	Edge.getNode0() First node of the edge.
<T extends Node> T	Edge.getNode1() Second node of the edge.
<T extends Node> java.util.Iterator<T>	Structure.getNodeIterator() Iterator on the set of nodes, in an undefined order.
<T extends Node> java.util.Iterator<T>	Path.getNodeIterator()
<T extends Node> java.util.Collection<T>	Structure.getNodeSet() Unmodifiable view of the set of nodes.
<T extends Node> java.util.Collection<T>	Path.getNodeSet()
<T extends Node> T	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> T	Edge.getSourceNode() Start node.
<T extends Node> T	Edge.getTargetNode() End node.
<T extends Node> T	Graph.removeNode(int index) Removes a node with a given index.
<T extends Node> T	Graph.removeNode(Node node) Removes a node.
<T extends Node> T	Graph.removeNode(java.lang.String id) Remove a node using its identifier.

Methods in org.graphstream.graph that return Node

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.

Methods in org.graphstream.graph that return types with arguments of type Node

Modifier and Type	Method and Description
java.util.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.

Methods in org.graphstream.graph with parameters of type Node

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> T	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> T	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	DepthFirstIterator.getDepthOf(Node node)
int	BreadthFirstIterator.getDepthOf(Node node)
<T extends Edge> T	Node.getEdgeBetween(Node node) Retrieves an edge between this node and and another node if one exists.
<T extends Edge> T	Node.getEdgeFrom(Node node) Retrieves an edge that leaves given node toward this node.
<T extends Edge> T	Node.getEdgeToward(Node node) Retrieves an edge that leaves this node toward another node.
<T extends Node> T	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(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).
<T extends Edge> T	Graph.removeEdge(Node node1, Node node2) Removes an edge between two nodes.
<T extends Node> T	Graph.removeNode(Node node) Removes a node.
void	Path.setRoot(Node root) Set the root (first node) of the path.
boolean	DepthFirstIterator.tabu(Node node)
boolean	BreadthFirstIterator.tabu(Node node)

Method parameters in org.graphstream.graph with type arguments of type Node

Modifier and Type	Method and Description
void	Graph.setNodeFactory(NodeFactory<? extends Node> nf) Set the node factory used to create nodes.

Constructors in org.graphstream.graph with parameters of type Node

Constructor and Description
BreadthFirstIterator(Node startNode)
BreadthFirstIterator(Node startNode, boolean directed)
DepthFirstIterator(Node startNode)
DepthFirstIterator(Node startNode, boolean directed)

Uses of Node in org.graphstream.graph.implementations

Classes in org.graphstream.graph.implementations with type parameters of type Node

Modifier and Type	Class and Description
protected class	AdjacencyListGraph.NodeIterator<T extends Node>

Classes in org.graphstream.graph.implementations that implement Node

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
(package private) static class	Graphs.SynchronizedNode
class	MultiNode Nodes used with MultiGraph
class	SingleNode Nodes used with SingleGraph

Fields in org.graphstream.graph.implementations with type parameters of type Node

Modifier and Type	Field and Description
(package private) java.util.HashMap<java.lang.String,Node>	Graphs.SynchronizedGraph.synchronizedNodes

Methods in org.graphstream.graph.implementations with type parameters of type Node

Modifier and Type	Method and Description
protected <T extends Node> T	AbstractGraph.addNode_(java.lang.String sourceId, long timeId, java.lang.String nodeId)
<T extends Node> T	Graphs.SynchronizedGraph.addNode(java.lang.String id)
<T extends Node> T	AbstractGraph.addNode(java.lang.String id)
<T extends Node> java.util.Iterator<T>	AbstractNode.getBreadthFirstIterator() This implementation creates an instance of org.graphstream.graph and returns it.
<T extends Node> java.util.Iterator<T>	AbstractNode.getBreadthFirstIterator(boolean directed) This implementation creates an instance of org.graphstream.graph and returns it.
<T extends Node> java.util.Iterator<T>	AbstractNode.getDepthFirstIterator() This implementation creates an instance of org.graphstream.graph and returns it.
<T extends Node> java.util.Iterator<T>	AbstractNode.getDepthFirstIterator(boolean directed) This implementation creates an instance of org.graphstream.graph and returns it.
<T extends Node> java.lang.Iterable<? extends T>	AbstractGraph.getEachNode() This implementation uses AbstractGraph.getNodeIterator()
<T extends Node> java.util.Iterator<T>	SingleNode.getNeighborNodeIterator()
<T extends Node> java.util.Iterator<T>	MultiNode.getNeighborNodeIterator()
<T extends Node> java.util.Iterator<T>	AbstractNode.getNeighborNodeIterator() This implementation uses AbstractNode.getEdgeIterator() and stores the visited nodes in a set.
<T extends Node> T	Graphs.SynchronizedGraph.getNode(int index)
<T extends Node> T	AdjacencyListGraph.getNode(int index)
abstract <T extends Node> T	AbstractGraph.getNode(int index)
<T extends Node> T	Graphs.SynchronizedGraph.getNode(java.lang.String id)
<T extends Node> T	AdjacencyListGraph.getNode(java.lang.String id)
abstract <T extends Node> T	AbstractGraph.getNode(java.lang.String id)
<T extends Node> T	Graphs.SynchronizedEdge.getNode0()
<T extends Node> T	AbstractEdge.getNode0()
<T extends Node> T	Graphs.SynchronizedEdge.getNode1()
<T extends Node> T	AbstractEdge.getNode1()
<T extends Node> java.util.Iterator<T>	AdjacencyListGraph.getNodeIterator()
abstract <T extends Node> java.util.Iterator<T>	AbstractGraph.getNodeIterator()
<T extends Node> java.util.Collection<T>	AbstractGraph.getNodeSet() This implementation uses AbstractGraph.getNodeIterator() and AbstractGraph.getNodeCount()
<T extends Node> T	Graphs.SynchronizedEdge.getOpposite(Node node)
<T extends Node> T	AbstractEdge.getOpposite(Node node)
<T extends Node> T	Graphs.SynchronizedEdge.getSourceNode()
<T extends Node> T	AbstractEdge.getSourceNode()
<T extends Node> T	Graphs.SynchronizedEdge.getTargetNode()
<T extends Node> T	AbstractEdge.getTargetNode()
protected <T extends Node> T	AbstractGraph.removeNode_(java.lang.String sourceId, long timeId, AbstractNode node, java.lang.String nodeId, boolean graphCallback)
<T extends Node> T	Graphs.SynchronizedGraph.removeNode(int index)
<T extends Node> T	AbstractGraph.removeNode(int index)
<T extends Node> T	Graphs.SynchronizedGraph.removeNode(Node node)
<T extends Node> T	AbstractGraph.removeNode(Node node)
<T extends Node> T	Graphs.SynchronizedGraph.removeNode(java.lang.String id)
<T extends Node> T	AbstractGraph.removeNode(java.lang.String id)

Methods in org.graphstream.graph.implementations that return types with arguments of type Node

Modifier and Type	Method and Description
java.util.Iterator<Node>	Graphs.SynchronizedNode.getBreadthFirstIterator()
java.util.Iterator<Node>	Graphs.SynchronizedNode.getBreadthFirstIterator(boolean directed)
java.util.Iterator<Node>	Graphs.SynchronizedNode.getDepthFirstIterator()
java.util.Iterator<Node>	Graphs.SynchronizedNode.getDepthFirstIterator(boolean directed)
java.lang.Iterable<Node>	Graphs.SynchronizedGraph.getEachNode()
java.util.Iterator<Node>	Graphs.SynchronizedNode.getNeighborNodeIterator()
java.util.Iterator<Node>	Graphs.SynchronizedGraph.getNodeIterator()
java.util.Collection<Node>	Graphs.SynchronizedGraph.getNodeSet()
java.util.Iterator<Node>	Graphs.SynchronizedGraph.iterator()
java.util.Iterator<Node>	AbstractGraph.iterator() This implementation returns AbstractGraph.getNodeIterator()
NodeFactory<? extends Node>	Graphs.SynchronizedGraph.nodeFactory()
NodeFactory<? extends Node>	AbstractGraph.nodeFactory()

Methods in org.graphstream.graph.implementations with parameters of type Node

Modifier and Type	Method and Description
<T extends Edge> T	Graphs.SynchronizedGraph.addEdge(java.lang.String id, Node node1, Node node2)
<T extends Edge> T	AbstractGraph.addEdge(java.lang.String id, Node node1, Node node2)
<T extends Edge> T	Graphs.SynchronizedGraph.addEdge(java.lang.String id, Node from, Node to, boolean directed)
<T extends Edge> T	AbstractGraph.addEdge(java.lang.String id, Node from, Node to, boolean directed)
<T extends Edge> T	Graphs.SynchronizedNode.getEdgeBetween(Node n)
<T extends Edge> T	AdjacencyListNode.getEdgeBetween(Node node)
abstract <T extends Edge> T	AbstractNode.getEdgeBetween(Node node)
<T extends Edge> T	Graphs.SynchronizedNode.getEdgeFrom(Node n)
<T extends Edge> T	AdjacencyListNode.getEdgeFrom(Node node)
abstract <T extends Edge> T	AbstractNode.getEdgeFrom(Node node)
<T extends Edge> java.util.Collection<T>	MultiNode.getEdgeSetBetween(Node node)
<T extends Edge> T	Graphs.SynchronizedNode.getEdgeToward(Node n)
<T extends Edge> T	AdjacencyListNode.getEdgeToward(Node node)
abstract <T extends Edge> T	AbstractNode.getEdgeToward(Node node)
<T extends Node> T	Graphs.SynchronizedEdge.getOpposite(Node node)
<T extends Node> T	AbstractEdge.getOpposite(Node node)
boolean	Graphs.SynchronizedNode.hasEdgeBetween(Node node)
boolean	AbstractNode.hasEdgeBetween(Node node) This implementation returns true if AbstractNode.getEdgeBetween(Node) is not null.
boolean	Graphs.SynchronizedNode.hasEdgeFrom(Node node)
boolean	AbstractNode.hasEdgeFrom(Node node) This implementation returns true if AbstractNode.getEdgeFrom(Node) is not null.
boolean	Graphs.SynchronizedNode.hasEdgeToward(Node node)
boolean	AbstractNode.hasEdgeToward(Node node) This implementation returns true if AbstractNode.getEdgeToward(Node) is not null.
protected <T extends Edge> T	SingleNode.locateEdge(Node opposite, char type)
protected <T extends Edge> T	MultiNode.locateEdge(Node opposite, char type)
protected <T extends Edge> T	AdjacencyListNode.locateEdge(Node opposite, char type)
<T extends Edge> T	Graphs.SynchronizedGraph.removeEdge(Node node1, Node node2)
<T extends Edge> T	AbstractGraph.removeEdge(Node node1, Node node2)
<T extends Node> T	Graphs.SynchronizedGraph.removeNode(Node node)
<T extends Node> T	AbstractGraph.removeNode(Node node)

Method parameters in org.graphstream.graph.implementations with type arguments of type Node

Modifier and Type	Method and Description
void	Graphs.SynchronizedGraph.setNodeFactory(NodeFactory<? extends Node> nf)
void	AbstractGraph.setNodeFactory(NodeFactory<? extends Node> nf)

Constructors in org.graphstream.graph.implementations with parameters of type Node

Constructor and Description
Graphs.SynchronizedNode(Graphs.SynchronizedGraph sg, Node n)

Uses of Node in org.graphstream.util

Classes in org.graphstream.util with type parameters of type Node

Modifier and Type	Class and Description
class	FilteredNodeIterator<T extends Node>

Fields in org.graphstream.util declared as Node

Modifier and Type	Field and Description
protected T	FilteredNodeIterator.next

Fields in org.graphstream.util with type parameters of type Node

Modifier and Type	Field and Description
protected Filter<Node>	FilteredNodeIterator.filter

Constructor parameters in org.graphstream.util with type arguments of type Node

Constructor and Description
FilteredNodeIterator(Graph g, Filter<Node> filter)
FilteredNodeIterator(java.util.Iterator<T> ite, Filter<Node> filter)