Uses of Interface
org.gephi.graph.api.Node

Packages that use Node

Package	Description
org.gephi.graph.api	Complete API description, where GraphModel is the entry point.

Uses of Node in org.gephi.graph.api

Methods in org.gephi.graph.api that return Node

Modifier and Type	Method	Description
Node	Graph.getNode(Object id)	Gets a node given its identifier.
Node	Graph.getNodeByStoreId(int storeId)	Gets a node given its store id.
Node	Graph.getOpposite(Node node, Edge edge)	Gets the node at the opposite end of the given edge.
Node	Edge.getSource()	Returns the egde's source.
Node	Edge.getTarget()	Returns the edge's target.
Node	GraphFactory.newNode()	Creates and returns a node.
Node	GraphFactory.newNode(Object id)	Creates and returns a node.
Node	NodeIterable.NodeIterableEmpty.next()
Node[]	NodeIterable.NodeIterableEmpty.toArray()
Node[]	NodeIterable.toArray()	Returns the iterator content as an array.

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

Modifier and Type	Method	Description
Index<Node>	GraphModel.getNodeIndex()	Gets the node index.
Index<Node>	GraphModel.getNodeIndex(GraphView view)	Gets the node index for the given graph view.
TimeIndex<Node>	GraphModel.getNodeTimeIndex()	Gets the node time index.
TimeIndex<Node>	GraphModel.getNodeTimeIndex(GraphView view)	Gets the node time index for the given view.
Iterator<Node>	NodeIterable.iterator()	Returns a node iterator.
Iterator<Node>	NodeIterable.NodeIterableEmpty.iterator()
Collection<Node>	NodeIterable.NodeIterableEmpty.toCollection()
Collection<Node>	NodeIterable.toCollection()	Returns the iterator content as a collection.
Set<Node>	NodeIterable.NodeIterableEmpty.toSet()
Set<Node>	NodeIterable.toSet()	Returns the iterator content as a set.

Methods in org.gephi.graph.api with parameters of type Node

Modifier and Type	Method	Description
boolean	Graph.addNode(Node node)	Adds a node to this graph.
boolean	Subgraph.addNode(Node node)	Adds a node to this subgraph.
void	Graph.clearEdges(Node node)	Clears the edges incident to the given node.
void	Graph.clearEdges(Node node, int type)	Clears the edges of the given type incident to the given node.
boolean	Graph.contains(Node node)	Returns true if node is contained in this graph.
void	GraphBridge.copyNodes(Node[] nodes)	Copy the given nodes to the current graph store.
int	Graph.getDegree(Node node)	Gets the node degree.
Edge	DirectedGraph.getEdge(Node source, Node target)	Gets the edge adjacent to source and target.
Edge	DirectedGraph.getEdge(Node source, Node target, int type)	Gets the edge adjacent to source and target with an edge of the given type.
Edge	Graph.getEdge(Node node1, Node node2)	Gets the edge adjacent to node1 and node2.
Edge	Graph.getEdge(Node node1, Node node2, int type)	Gets the edge adjacent to node1 and node2 and from the given type.
EdgeIterable	Graph.getEdges(Node node)	Gets all edges incident to a given node.
EdgeIterable	Graph.getEdges(Node node, int type)	Gets all edges incident to a given node with the given edge type.
EdgeIterable	Graph.getEdges(Node node1, Node node2)	Get the edges adjacent to node1 and node2.
EdgeIterable	Graph.getEdges(Node node1, Node node2, int type)	Gets the edges adjacent to node1 and node 2 and from the given type.
int	DirectedGraph.getInDegree(Node node)	Gets the edge's in-degree.
EdgeIterable	DirectedGraph.getInEdges(Node node)	Gets the node's incoming edges.
EdgeIterable	DirectedGraph.getInEdges(Node node, int type)	Gets the node's incoming edges for the given type.
NodeIterable	Graph.getNeighbors(Node node)	Gets all neighbors of a given node.
NodeIterable	Graph.getNeighbors(Node node, int type)	Gets all neighbors of a given node connected through the given edge type.
Node	Graph.getOpposite(Node node, Edge edge)	Gets the node at the opposite end of the given edge.
int	DirectedGraph.getOutDegree(Node node)	Gets the edge's out-degree.
EdgeIterable	DirectedGraph.getOutEdges(Node node)	Gets the node's outgoing edges.
EdgeIterable	DirectedGraph.getOutEdges(Node node, int type)	Gets the node's incoming edges for the given type.
NodeIterable	DirectedGraph.getPredecessors(Node node)	Gets the node's predecessors.
NodeIterable	DirectedGraph.getPredecessors(Node node, int type)	Gets the node's predecessors through a specific edge type.
NodeIterable	DirectedGraph.getSuccessors(Node node)	Gets the node's successors.
NodeIterable	DirectedGraph.getSuccessors(Node node, int type)	Gets the node's successors through a specific edge type.
boolean	DirectedGraph.isAdjacent(Node source, Node target)	Returns true if source and target are adjacent.
boolean	DirectedGraph.isAdjacent(Node source, Node target, int type)	Returns true if source and target are adjacent with an edge of the given type.
boolean	Graph.isAdjacent(Node node1, Node node2)	Returns true if node1 and node2 are adjacent.
boolean	Graph.isAdjacent(Node node1, Node node2, int type)	Returns true if node1 and node2 are adjacent with an edge of the given type.
boolean	Graph.isIncident(Node node, Edge edge)	Returns true if the node and the edge are incident.
Edge	GraphFactory.newEdge(Object id, Node source, Node target, int type, double weight, boolean directed)	Creates and returns an edge between source and target.
Edge	GraphFactory.newEdge(Node source, Node target)	Creates and returns a directed edge between source and target.
Edge	GraphFactory.newEdge(Node source, Node target, boolean directed)	Creates and returns an edge between source and target.
Edge	GraphFactory.newEdge(Node source, Node target, int type, boolean directed)	Creates and returns an edge between source and target.
Edge	GraphFactory.newEdge(Node source, Node target, int type, double weight, boolean directed)	Creates and returns an edge between source and target.
boolean	Graph.removeNode(Node node)	Removes a node from this graph.
boolean	Subgraph.removeNode(Node node)	Removes a node from this subgraph.

Method parameters in org.gephi.graph.api with type arguments of type Node

Modifier and Type	Method	Description
boolean	Graph.addAllNodes(Collection<? extends Node> nodes)	Adds all nodes in the collection to this graph.
boolean	Subgraph.addAllNodes(Collection<? extends Node> nodes)	Adds a collection of nodes to this subgraph.
boolean	Graph.removeAllNodes(Collection<? extends Node> nodes)	Removes all nodes in the collection from this graph.
boolean	Subgraph.removeAllNodes(Collection<? extends Node> nodes)	Removes a collection of nodes from this subgraph.
boolean	Graph.retainNodes(Collection<? extends Node> nodes)	Retains only nodes in this graph that are contained in the specified collection.
boolean	Subgraph.retainNodes(Collection<? extends Node> nodes)	Retains only nodes in this subgraph that are contained in the specified collection.