Uses of Interface
org.graphstream.graph.Node

Packages that use Node
org.graphstream.graph   
org.graphstream.graph.implementations   
org.graphstream.ui.graphicGraph   
org.graphstream.util   
 

Uses of Node in org.graphstream.graph
 

Classes in org.graphstream.graph with type parameters of type Node
 class BreadthFirstIterator<T extends Node>
           
 class DepthFirstIterator<T extends Node>
           
 interface NodeFactory<T extends Node>
          An interface aimed at dynamically creating node objects.
 

Methods in org.graphstream.graph with type parameters of type Node
<T extends Node>
T
Graph.addNode(String id)
          Add a node in the graph.
<T extends Node>
Iterator<T>
Node.getBreadthFirstIterator()
          Iterator for breadth first exploration of the graph, starting at this node.
<T extends Node>
Iterator<T>
Node.getBreadthFirstIterator(boolean directed)
          Iterator for breadth first exploration of the graph, starting at this node.
<T extends Node>
Iterator<T>
Node.getDepthFirstIterator()
          Iterator for depth first exploration of the graph, starting at this node.
<T extends Node>
Iterator<T>
Node.getDepthFirstIterator(boolean directed)
          Iterator for depth first exploration of the graph, starting at this node.
<T extends Node>
Iterable<? extends T>
Structure.getEachNode()
          Set of nodes usable in a for-each instruction.
<T extends Node>
Iterable<? extends T>
Path.getEachNode()
           
<T extends Node>
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(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>
Iterator<T>
Structure.getNodeIterator()
          Iterator on the set of nodes, in an undefined order.
<T extends Node>
Iterator<T>
Path.getNodeIterator()
           
<T extends Node>
Collection<T>
Structure.getNodeSet()
          Unmodifiable view of the set of nodes.
<T extends Node>
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(String id)
          Remove a node using its identifier.
 

Methods in org.graphstream.graph that return Node
 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
 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
 void Path.add(Node from, Edge edge)
          Method that adds a node (and an edge) to the path.
<T extends Edge>
T
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>
T
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>
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(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 BreadthFirstIterator.tabu(Node node)
           
 boolean DepthFirstIterator.tabu(Node node)
           
 

Method parameters in org.graphstream.graph with type arguments of type Node
 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
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 that implement Node
 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
 

Methods in org.graphstream.graph.implementations with type parameters of type Node
<T extends Node>
T
AbstractGraph.addNode(String id)
           
<T extends Node>
Iterator<T>
AbstractNode.getBreadthFirstIterator()
          This implementation creates an instance of org.graphstream.graph and returns it.
<T extends Node>
Iterator<T>
AbstractNode.getBreadthFirstIterator(boolean directed)
          This implementation creates an instance of org.graphstream.graph and returns it.
<T extends Node>
Iterator<T>
AbstractNode.getDepthFirstIterator()
          This implementation creates an instance of org.graphstream.graph and returns it.
<T extends Node>
Iterator<T>
AbstractNode.getDepthFirstIterator(boolean directed)
          This implementation creates an instance of org.graphstream.graph and returns it.
<T extends Node>
Iterable<? extends T>
AbstractGraph.getEachNode()
          This implementation uses AbstractGraph.getNodeIterator()
<T extends Node>
Iterator<T>
MultiNode.getNeighborNodeIterator()
           
<T extends Node>
Iterator<T>
AbstractNode.getNeighborNodeIterator()
          This implementation uses AbstractNode.getEdgeIterator() and stores the visited nodes in a set.
<T extends Node>
Iterator<T>
SingleNode.getNeighborNodeIterator()
           
<T extends Node>
T
AdjacencyListGraph.getNode(int index)
           
abstract
<T extends Node>
T
AbstractGraph.getNode(int index)
           
<T extends Node>
T
AdjacencyListGraph.getNode(String id)
           
abstract
<T extends Node>
T
AbstractGraph.getNode(String id)
           
<T extends Node>
T
AbstractEdge.getNode0()
           
<T extends Node>
T
AbstractEdge.getNode1()
           
<T extends Node>
Iterator<T>
AdjacencyListGraph.getNodeIterator()
           
abstract
<T extends Node>
Iterator<T>
AbstractGraph.getNodeIterator()
           
<T extends Node>
Collection<T>
AbstractGraph.getNodeSet()
          This implementation uses AbstractGraph.getNodeIterator() and AbstractGraph.getNodeCount()
<T extends Node>
T
AbstractEdge.getOpposite(Node node)
           
<T extends Node>
T
AbstractEdge.getSourceNode()
           
<T extends Node>
T
AbstractEdge.getTargetNode()
           
<T extends Node>
T
AbstractGraph.removeNode(int index)
           
<T extends Node>
T
AbstractGraph.removeNode(Node node)
           
<T extends Node>
T
AbstractGraph.removeNode(String id)
           
 

Methods in org.graphstream.graph.implementations that return types with arguments of type Node
 Iterator<Node> AbstractGraph.iterator()
          This implementation returns AbstractGraph.getNodeIterator()
 NodeFactory<? extends Node> AbstractGraph.nodeFactory()
           
 

Methods in org.graphstream.graph.implementations with parameters of type Node
<T extends Edge>
T
AbstractGraph.addEdge(String id, Node node1, Node node2)
           
<T extends Edge>
T
AbstractGraph.addEdge(String id, Node from, Node to, boolean directed)
           
<T extends Edge>
T
AdjacencyListNode.getEdgeBetween(Node node)
           
abstract
<T extends Edge>
T
AbstractNode.getEdgeBetween(Node node)
           
<T extends Edge>
T
AdjacencyListNode.getEdgeFrom(Node node)
           
abstract
<T extends Edge>
T
AbstractNode.getEdgeFrom(Node node)
           
<T extends Edge>
Collection<T>
MultiNode.getEdgeSetBetween(Node node)
           
<T extends Edge>
T
AdjacencyListNode.getEdgeToward(Node node)
           
abstract
<T extends Edge>
T
AbstractNode.getEdgeToward(Node node)
           
<T extends Node>
T
AbstractEdge.getOpposite(Node node)
           
 boolean AbstractNode.hasEdgeBetween(Node node)
          This implementation returns true if AbstractNode.getEdgeBetween(Node) is not null.
 boolean AbstractNode.hasEdgeFrom(Node node)
          This implementation returns true if AbstractNode.getEdgeFrom(Node) is not null.
 boolean AbstractNode.hasEdgeToward(Node node)
          This implementation returns true if AbstractNode.getEdgeToward(Node) is not null.
<T extends Edge>
T
AbstractGraph.removeEdge(Node node1, Node node2)
           
<T extends Node>
T
AbstractGraph.removeNode(Node node)
           
 

Method parameters in org.graphstream.graph.implementations with type arguments of type Node
 void AbstractGraph.setNodeFactory(NodeFactory<? extends Node> nf)
           
 

Uses of Node in org.graphstream.ui.graphicGraph
 

Classes in org.graphstream.ui.graphicGraph that implement Node
 class GraphicNode
          Graphical node.
 

Methods in org.graphstream.ui.graphicGraph with type parameters of type Node
<T extends Node>
T
GraphicGraph.addNode(String id)
           
<T extends Node>
T
GraphicGraph.getNode(int index)
           
<T extends Node>
T
GraphicGraph.getNode(String id)
           
<T extends Node>
T
GraphicEdge.getNode0()
           
<T extends Node>
T
GraphicEdge.getNode1()
           
<T extends Node>
Iterator<T>
GraphicGraph.getNodeIterator()
           
<T extends Node>
Collection<T>
GraphicGraph.getNodeSet()
           
<T extends Node>
T
GraphicEdge.getOpposite(Node node)
           
<T extends Node>
T
GraphicEdge.getSourceNode()
           
<T extends Node>
T
GraphicEdge.getTargetNode()
           
<T extends Node>
T
GraphicGraph.removeNode(int index)
           
<T extends Node>
T
GraphicGraph.removeNode(Node node)
           
<T extends Node>
T
GraphicGraph.removeNode(String id)
           
 

Methods in org.graphstream.ui.graphicGraph that return Node
 Node StyleGroupSet.getNode(String id)
          Get a node element knowing its identifier.
 Node GraphicGraph.removeNode(String sourceId, long timeId, String id)
           
 

Methods in org.graphstream.ui.graphicGraph that return types with arguments of type Node
 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.
 

Methods in org.graphstream.ui.graphicGraph with parameters of type Node
<T extends Edge>
T
GraphicGraph.addEdge(String id, Node node1, Node node2)
           
<T extends Edge>
T
GraphicGraph.addEdge(String id, Node from, Node to, boolean directed)
           
<T extends Edge>
T
GraphicNode.getEdgeBetween(Node Node)
           
<T extends Edge>
T
GraphicNode.getEdgeFrom(Node Node)
           
<T extends Edge>
T
GraphicNode.getEdgeToward(Node Node)
           
<T extends Node>
T
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>
T
GraphicGraph.removeEdge(Node node1, Node node2)
           
<T extends Node>
T
GraphicGraph.removeNode(Node node)
           
 

Method parameters in org.graphstream.ui.graphicGraph with type arguments of type Node
 void GraphicGraph.setNodeFactory(NodeFactory<? extends Node> nf)
           
 

Uses of Node in org.graphstream.util
 

Classes in org.graphstream.util with type parameters of type Node
 class FilteredNodeIterator<T extends Node>
           
 

Constructor parameters in org.graphstream.util with type arguments of type Node
FilteredNodeIterator(Graph g, Filter<Node> filter)
           
FilteredNodeIterator(Iterator<T> ite, Filter<Node> filter)
           
 



Copyright © 2013. All Rights Reserved.