Package | Description |
---|---|
org.gephi.datalab.api |
Data Laboratory API, all capabilites are exposed through various controllers.
|
org.gephi.datalab.spi.nodes | |
org.gephi.graph.api |
Complete API description, where
GraphModel is the entry point. |
org.gephi.tools.api |
API for selecting the current Tool.
|
org.gephi.tools.spi |
Interfaces for creating new tools.
|
Modifier and Type | Method and Description |
---|---|
Node |
GraphElementsController.createNode(String label)
Creates a node with default id and the given label in the current graph.
|
Node |
GraphElementsController.createNode(String label,
Graph graph)
Creates a node with default id and the given label.
|
Node |
GraphElementsController.createNode(String label,
String id)
Creates a node with the given id and label in the current graph.
|
Node |
GraphElementsController.createNode(String label,
String id,
Graph graph)
Creates a node with the given id and label.
|
Node |
GraphElementsController.duplicateNode(Node node)
Duplicates a node if it is in the graph, and returns the new node.
|
Node |
SearchReplaceController.SearchResult.getFoundNode() |
Node[] |
GraphElementsController.getNodeNeighbours(Node node)
Prepares and returns an array with the neighbour nodes of the specified node.
|
Node[] |
SearchReplaceController.SearchOptions.getNodesToSearch() |
Node |
GraphElementsController.mergeNodes(Graph graph,
Node[] nodes,
Node selectedNode,
Column[] columns,
AttributeRowsMergeStrategy[] mergeStrategies,
boolean deleteMergedNodes)
Merges 2 or more nodes into a new one node that has all the edges of the merged nodes.
|
Modifier and Type | Method and Description |
---|---|
List<List<Node>> |
AttributeColumnsController.detectNodeDuplicatesByColumn(Column column,
boolean caseSensitive)
Finds and returns nodes duplicates based on the values of a given column of nodes table
|
Modifier and Type | Method and Description |
---|---|
boolean |
GraphElementsController.areNodesInGraph(Node[] nodes)
Checks if an array of nodes are contained in the main view graph.
|
void |
AttributeColumnsController.clearNodeData(Node node,
Column[] columnsToClear)
Clears all node attributes except computed attributes and id, checking first that the node is in the graph.
|
void |
AttributeColumnsController.clearNodesData(Node[] nodes,
Column[] columnsToClear)
Clears all the nodes attributes except computed attributes and id.
|
void |
AttributeColumnsController.copyNodeDataToOtherNodes(Node node,
Node[] otherNodes,
Column[] columnsToCopy)
Copies attributes data of the given node to the other rows except computed attributes and id.
|
void |
AttributeColumnsController.copyNodeDataToOtherNodes(Node node,
Node[] otherNodes,
Column[] columnsToCopy)
Copies attributes data of the given node to the other rows except computed attributes and id.
|
Edge |
GraphElementsController.createEdge(Node source,
Node target,
boolean directed)
Creates and edge between source and target node (if it does not already exist), directed or undirected, in the current graph.
|
Edge |
GraphElementsController.createEdge(Node source,
Node target,
boolean directed,
Graph graph)
Creates and edge between source and target node (if it does not already exist), directed or undirected.
|
Edge |
GraphElementsController.createEdge(Node source,
Node target,
boolean directed,
Object typeLabel)
Creates and edge between source and target node (if it does not already exist), directed or undirected, in the current graph.
|
Edge |
GraphElementsController.createEdge(Node source,
Node target,
boolean directed,
Object typeLabel,
Graph graph)
Creates and edge between source and target node (if it does not already exist), directed or undirected.
|
Edge |
GraphElementsController.createEdge(String id,
Node source,
Node target,
boolean directed)
Creates and edge between source and target node (if it does not already exist), directed or undirected.
|
Edge |
GraphElementsController.createEdge(String id,
Node source,
Node target,
boolean directed,
Graph graph)
Creates and edge between source and target node (if it does not already exist), directed or undirected, in the current graph.
|
Edge |
GraphElementsController.createEdge(String id,
Node source,
Node target,
boolean directed,
Object typeLabel)
Creates and edge between source and target node (if it does not already exist), directed or undirected.
|
Edge |
GraphElementsController.createEdge(String id,
Node source,
Node target,
boolean directed,
Object typeLabel,
Graph graph)
Creates and edge between source and target node (if it does not already exist), directed or undirected, in the current graph.
|
void |
GraphElementsController.createEdges(Node source,
Node[] allNodes,
boolean directed)
Tries to create edges between the source node and all other edges, directed or undirected.
|
void |
GraphElementsController.createEdges(Node source,
Node[] allNodes,
boolean directed)
Tries to create edges between the source node and all other edges, directed or undirected.
|
void |
GraphElementsController.deleteNode(Node node)
Tries to delete a node checking first if it is on the graph.
|
void |
GraphElementsController.deleteNodes(Node[] nodes)
Tries to delete an array of nodes checking first if they are on the graph.
|
Node |
GraphElementsController.duplicateNode(Node node)
Duplicates a node if it is in the graph, and returns the new node.
|
void |
GraphElementsController.duplicateNodes(Node[] nodes)
Tries to duplicate an array of nodes with the same behaviour as
duplicateNode method. |
void |
AttributeColumnsController.fillNodesColumnWithValue(Node[] nodes,
Column column,
String value)
Fills the data values of a given column of the indicated nodes with a value as a String,
parsing it for the
Class of the column. |
Edge[] |
GraphElementsController.getNodeEdges(Node node)
Prepares and returns an array with the edges incident to the specified node.
|
Node[] |
GraphElementsController.getNodeNeighbours(Node node)
Prepares and returns an array with the neighbour nodes of the specified node.
|
boolean |
GraphElementsController.isNodeFixed(Node node)
Checks the fixed state of a node.
|
boolean |
GraphElementsController.isNodeInGraph(Node node)
Checks if a node is contained in the main view graph.
|
Node |
GraphElementsController.mergeNodes(Graph graph,
Node[] nodes,
Node selectedNode,
Column[] columns,
AttributeRowsMergeStrategy[] mergeStrategies,
boolean deleteMergedNodes)
Merges 2 or more nodes into a new one node that has all the edges of the merged nodes.
|
Node |
GraphElementsController.mergeNodes(Graph graph,
Node[] nodes,
Node selectedNode,
Column[] columns,
AttributeRowsMergeStrategy[] mergeStrategies,
boolean deleteMergedNodes)
Merges 2 or more nodes into a new one node that has all the edges of the merged nodes.
|
void |
SearchReplaceController.SearchResult.setFoundNode(Node foundNode) |
void |
GraphElementsController.setNodeFixed(Node node,
boolean fixed)
Sets the fixed state of a node to the indicated.
|
void |
GraphElementsController.setNodesFixed(Node[] nodes,
boolean fixed)
Sets the fixed state of an array of nodes to the indicated.
|
Constructor and Description |
---|
SearchOptions(Node[] nodesToSearch,
Pattern regexPattern)
Setup options to search on nodes with the given pattern.
|
SearchOptions(Node[] nodesToSearch,
Pattern regexPattern,
boolean onlyMatchWholeAttributeValue)
Setup options to search on nodes with the given pattern.
|
SearchResult(SearchReplaceController.SearchOptions searchOptions,
Node foundNode,
Edge foundEdge,
int foundRowIndex,
int foundColumnIndex,
int start,
int end) |
Modifier and Type | Method and Description |
---|---|
void |
NodesManipulator.setup(Node[] nodes,
Node clickedNode)
Prepare nodes for this action.
|
void |
NodesManipulator.setup(Node[] nodes,
Node clickedNode)
Prepare nodes for this action.
|
Modifier and Type | Method and Description |
---|---|
Node |
Graph.getNode(Object id)
Gets a node given its identifier.
|
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.toArray()
Returns the iterator content as an array.
|
Node[] |
NodeIterable.NodeIterableEmpty.toArray() |
Modifier and Type | Method and 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.toCollection()
Returns the iterator content as a collection.
|
Collection<Node> |
NodeIterable.NodeIterableEmpty.toCollection() |
Modifier and Type | Method and Description |
---|---|
boolean |
Subgraph.addNode(Node node)
Adds a node to this subgraph.
|
boolean |
Graph.addNode(Node node)
Adds a node to this graph.
|
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 |
Graph.getEdge(Node node1,
Node node2)
Gets the edge adjacent to node1 and node2.
|
Edge |
DirectedGraph.getEdge(Node source,
Node target)
Gets the edge adjacent to source and target.
|
Edge |
Graph.getEdge(Node node1,
Node node2,
int type)
Gets the edge adjacent to node1 and node2 and from the given type.
|
Edge |
DirectedGraph.getEdge(Node source,
Node target,
int type)
Gets the edge adjacent to source and target with an edge of 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.
|
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 |
Graph.isAdjacent(Node node1,
Node node2)
Returns true if node1 and node2 are adjacent.
|
boolean |
DirectedGraph.isAdjacent(Node source,
Node target)
Returns true if source and target 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 |
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.isIncident(Node node,
Edge edge)
Returns true if the node and the edge are incident.
|
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.
|
Edge |
GraphFactory.newEdge(Object id,
Node source,
Node target,
int type,
double weight,
boolean directed)
Creates and returns an edge between source and target.
|
boolean |
Subgraph.removeNode(Node node)
Removes a node from this subgraph.
|
boolean |
Graph.removeNode(Node node)
Removes a node from this graph.
|
Modifier and Type | Method and Description |
---|---|
boolean |
Subgraph.addAllNodes(Collection<? extends Node> nodes)
Adds a collection of nodes to this subgraph.
|
boolean |
Graph.addAllNodes(Collection<? extends Node> nodes)
Adds all nodes in the collection to this graph.
|
boolean |
Subgraph.removeAllNodes(Collection<? extends Node> nodes)
Removes a collection of nodes from this subgraph.
|
boolean |
Graph.removeAllNodes(Collection<? extends Node> nodes)
Removes all nodes in the collection from this graph.
|
Modifier and Type | Method and Description |
---|---|
void |
EditWindowController.editNode(Node node) |
void |
EditWindowController.editNodes(Node[] nodes) |
Modifier and Type | Method and Description |
---|---|
void |
NodeClickEventListener.clickNodes(Node[] nodes)
Notify
nodes have been clicked by user on the visualization
window. |
void |
NodePressingEventListener.pressingNodes(Node[] nodes)
Notify
nodes are currently pressed. |
void |
NodePressAndDraggingEventListener.pressNodes(Node[] nodes)
Notify
nodes have been pressed by user on the visualization
window. |
Copyright © 2007–2015 Gephi Consortium. All rights reserved.