Gephi Toolkit Javadoc

org.gephi.preview.api
Interface Graph


public interface Graph

Interface of a preview graph.

Author:
Jérémy Subtil

Method Summary
 int countBidirectionalEdges()
          Returns the number of bidirectional edges in the graph.
 int countNodes()
          Returns the number of nodes in the graph.
 int countSelfLoops()
          Returns the number of self-loops in the graph.
 int countUndirectedEdges()
          Returns the number of undirected edges in the graph.
 int countUnidirectionalEdges()
          Returns the number of unidirectional edges in the graph.
 java.lang.Iterable<BidirectionalEdge> getBidirectionalEdges()
          Returns an iterable on the graph's bidirectional edges.
 java.lang.Iterable<Node> getNodes()
          Returns an iterable on the graph's nodes.
 java.lang.Iterable<SelfLoop> getSelfLoops()
          Returns an iterable on the graph's self-loops.
 java.lang.Iterable<UndirectedEdge> getUndirectedEdges()
          Returns an iterable on the graph's undirected edges.
 java.lang.Iterable<UnidirectionalEdge> getUnidirectionalEdges()
          Returns an iterable on the graph's unidirectional edges.
 java.lang.Boolean showEdges()
          Returns true if the edges must be displayed in the preview.
 java.lang.Boolean showNodes()
          Returns true if the nodes must be displayed in the preview.
 java.lang.Boolean showSelfLoops()
          Returns true if the self-loops must be displayed in the preview.
 

Method Detail

getNodes

java.lang.Iterable<Node> getNodes()
Returns an iterable on the graph's nodes.

Returns:
an iterable on the graph's nodes

getSelfLoops

java.lang.Iterable<SelfLoop> getSelfLoops()
Returns an iterable on the graph's self-loops.

Returns:
an iterable on the graph's self-loops

getUnidirectionalEdges

java.lang.Iterable<UnidirectionalEdge> getUnidirectionalEdges()
Returns an iterable on the graph's unidirectional edges.

Returns:
an iterable on the graph's unidirectional edges

getBidirectionalEdges

java.lang.Iterable<BidirectionalEdge> getBidirectionalEdges()
Returns an iterable on the graph's bidirectional edges.

Returns:
an iterable on the graph's bidirectional edges

getUndirectedEdges

java.lang.Iterable<UndirectedEdge> getUndirectedEdges()
Returns an iterable on the graph's undirected edges.

Returns:
an iterable on the graph's undirected edges

countNodes

int countNodes()
Returns the number of nodes in the graph.

Returns:
the number of nodes in the graph

countSelfLoops

int countSelfLoops()
Returns the number of self-loops in the graph.

Returns:
the number of self-loops in the graph

countUnidirectionalEdges

int countUnidirectionalEdges()
Returns the number of unidirectional edges in the graph.

Returns:
the number of unidirectional edges in the graph

countBidirectionalEdges

int countBidirectionalEdges()
Returns the number of bidirectional edges in the graph.

Returns:
the number of bidirectional edges in the graph

countUndirectedEdges

int countUndirectedEdges()
Returns the number of undirected edges in the graph.

Returns:
the number of undirected edges in the graph

showNodes

java.lang.Boolean showNodes()
Returns true if the nodes must be displayed in the preview.

Returns:
true if the nodes must be displayed in the preview

showEdges

java.lang.Boolean showEdges()
Returns true if the edges must be displayed in the preview.

Returns:
true if the edges must be displayed in the preview

showSelfLoops

java.lang.Boolean showSelfLoops()
Returns true if the self-loops must be displayed in the preview.

Returns:
true if the self-loops must be displayed in the preview

Gephi Toolkit Javadoc