Skip navigation links
A B C D E F G H I K L M N O P R S T U V W X Y 

I

id() - Method in class org.graphstream.algorithm.community.Community
Return the community identifier.
id - Variable in class org.graphstream.algorithm.ConnectedComponents.ConnectedComponent
The unique id of this component.
illegalArgumentException() - Static method in class org.graphstream.algorithm.Toolkit
 
IncompleteGridGenerator - Class in org.graphstream.algorithm.generator
A grid generator with holes.
IncompleteGridGenerator() - Constructor for class org.graphstream.algorithm.generator.IncompleteGridGenerator
New generator.
IncompleteGridGenerator(boolean, float, int, int) - Constructor for class org.graphstream.algorithm.generator.IncompleteGridGenerator
New generator.
init(Graph) - Method in class org.graphstream.algorithm.AbstractSpanningTree
 
init(Graph) - Method in interface org.graphstream.algorithm.Algorithm
Initialization of the algorithm.
init(Graph) - Method in class org.graphstream.algorithm.APSP
 
init(Graph) - Method in class org.graphstream.algorithm.AStar
 
init(Graph) - Method in class org.graphstream.algorithm.BellmanFord
 
init(Graph) - Method in class org.graphstream.algorithm.BetweennessCentrality
Setup the algorithm to work on the given graph.
init(Graph) - Method in class org.graphstream.algorithm.Centroid
 
init(Graph) - Method in class org.graphstream.algorithm.coloring.WelshPowell
 
init(Graph, String) - Method in class org.graphstream.algorithm.community.DecentralizedCommunityAlgorithm
Initialize the distributed community detection algorithm, attaching it to the specified graph, and using the specified marker to store the community attribute
init(Graph) - Method in class org.graphstream.algorithm.community.DecentralizedCommunityAlgorithm
Initialize the distributed community detection algorithm, attaching it to the specified graph, and using the default marker to store the community attribute.
init(Graph) - Method in class org.graphstream.algorithm.ConnectedComponents
 
init(Graph) - Method in class org.graphstream.algorithm.DStar
 
init(Node, Node, Graph) - Method in class org.graphstream.algorithm.DStar
 
init(Graph) - Method in class org.graphstream.algorithm.Eccentricity
 
init(Graph, String, String) - Method in interface org.graphstream.algorithm.flow.FlowAlgorithm
Init the algorithm.
init(Graph) - Method in class org.graphstream.algorithm.flow.FlowAlgorithmBase
 
init(Graph, String, String) - Method in class org.graphstream.algorithm.flow.FlowAlgorithmBase
 
init(Graph) - Method in class org.graphstream.algorithm.LongestPath
 
init(Graph) - Method in class org.graphstream.algorithm.measure.AbstractCentrality
 
init(Graph) - Method in class org.graphstream.algorithm.measure.ChartConnectivityMeasure.ChartEdgeConnectivityMeasure
 
init(Graph) - Method in class org.graphstream.algorithm.measure.ChartConnectivityMeasure.ChartVertexConnectivityMeasure
 
init(Graph) - Method in class org.graphstream.algorithm.measure.ChartConnectivityMeasure
 
init(Graph) - Method in class org.graphstream.algorithm.measure.ClosenessCentrality
 
init(Graph) - Method in class org.graphstream.algorithm.measure.CommunityMeasure
 
init(Graph) - Method in class org.graphstream.algorithm.measure.ConnectivityMeasure.EdgeConnectivityMeasure
 
init(Graph) - Method in class org.graphstream.algorithm.measure.ConnectivityMeasure.VertexConnectivityMeasure
 
init(Graph) - Method in class org.graphstream.algorithm.measure.DegreeMeasure
 
init(Graph) - Method in class org.graphstream.algorithm.measure.ElementCountMeasure
 
init(Graph) - Method in class org.graphstream.algorithm.measure.SurpriseMeasure
 
init(Graph) - Method in class org.graphstream.algorithm.networksimplex.DynamicOneToAllShortestPath
 
init(Graph) - Method in class org.graphstream.algorithm.networksimplex.NetworkSimplex
 
init(Graph) - Method in class org.graphstream.algorithm.PageRank
 
init(Graph) - Method in class org.graphstream.algorithm.randomWalk.RandomWalk
Initialize the algorithm for a given graph with a given entity count.
init(RandomWalk.Context, Node) - Method in class org.graphstream.algorithm.randomWalk.TabuEntity
Start the entity on the given node.
init(Graph) - Method in class org.graphstream.algorithm.Spectrum
 
init(Graph) - Method in class org.graphstream.algorithm.TarjanStronglyConnectedComponents
 
init(Graph) - Method in class org.graphstream.algorithm.TopologicalSortDFS
 
init(Graph) - Method in class org.graphstream.algorithm.TopologicalSortKahn
 
inputPos(String) - Method in class org.graphstream.ui.layout.Eades84Layout
 
inputPos(String) - Method in class org.graphstream.ui.layout.HierarchicalLayout
 
inSameSet(Object, Object) - Method in class org.graphstream.algorithm.util.DisjointSets
Checks if two elements belong to the same set.
IntegerIndexGenerator() - Constructor for class org.graphstream.algorithm.TarjanStronglyConnectedComponents.IntegerIndexGenerator
 
InvalidParameterException - Exception in org.graphstream.algorithm
 
InvalidParameterException() - Constructor for exception org.graphstream.algorithm.InvalidParameterException
 
InvalidParameterException(String, Object...) - Constructor for exception org.graphstream.algorithm.InvalidParameterException
 
isClique(Collection<? extends Node>) - Static method in class org.graphstream.algorithm.Toolkit
Checks if a set of nodes is a clique.
isConnected(Graph) - Static method in class org.graphstream.algorithm.Toolkit
Determines if a graph is (weakly) connected.
isCoordsPushed() - Method in class org.graphstream.algorithm.generator.LifeGenerator
 
isDirected() - Method in class org.graphstream.algorithm.APSP
True if the algorithm must take edge orientation into account.
isEmpty() - Method in class org.graphstream.algorithm.FixedArrayList
 
isEmpty() - Method in class org.graphstream.algorithm.util.FibonacciHeap
Checks if the heap is empty.
isKEdgeConnected(Graph, int) - Static method in class org.graphstream.algorithm.measure.ConnectivityMeasure
Check if a graph is k-edge-connected, ie. there is no (k-1)-edge-tuple such that the removal of these edges leads to disconnect the graph.
isKVertexConnected(Graph, int) - Static method in class org.graphstream.algorithm.measure.ConnectivityMeasure
Check if a graph is k-vertex-connected, ie. there is no (k-1)-node-tuple such that the removal of these nodes leads to disconnect the graph.
isMaximalClique(Collection<? extends Node>, Graph) - Static method in class org.graphstream.algorithm.Toolkit
Checks if a set of nodes is a maximal clique.
isSeparateMinMaxAxis() - Method in class org.graphstream.algorithm.measure.ChartMinMaxAverageSeriesMeasure
Flag used to define if min and max are plotted to a different axis than average.
isTore() - Method in class org.graphstream.algorithm.generator.LifeGenerator
 
isUsingInternalGraph() - Method in class org.graphstream.algorithm.generator.BaseGenerator
Flag to know if an internal graph is in use.
iterator() - Method in class org.graphstream.algorithm.ConnectedComponents
 
iterator() - Method in class org.graphstream.algorithm.FixedArrayList
 
A B C D E F G H I K L M N O P R S T U V W X Y 
Skip navigation links