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

C

centrality(Node) - Method in class org.graphstream.algorithm.BetweennessCentrality

The centrality value of the given node.

Centroid - Class in org.graphstream.algorithm

Compute the centroid of a connected graph.

Centroid() - Constructor for class org.graphstream.algorithm.Centroid

Build a new centroid algorithm with default parameters.

Centroid(String) - Constructor for class org.graphstream.algorithm.Centroid

Build a new centroid algorithm, specifying the attribute name of the computation result

Centroid(String, Object, Object) - Constructor for class org.graphstream.algorithm.Centroid

Build a new centroid as in Centroid.Centroid(String) but specifying values of centroid membership.

Centroid(String, Object, Object, String) - Constructor for class org.graphstream.algorithm.Centroid

Build a new centroid algorithm as in Centroid.Centroid(String, Object, Object) but specifying the name of the attribute where the APSP informations are stored.

ChvatalGenerator - Class in org.graphstream.algorithm.generator

Generate the Chvatal graph.

ChvatalGenerator() - Constructor for class org.graphstream.algorithm.generator.ChvatalGenerator

clear() - Method in class org.graphstream.ui.layout.Eades84Layout

clusteringCoefficient(Node) - Static method in class org.graphstream.algorithm.Toolkit

Clustering coefficient for one node of the graph.

clusteringCoefficients(Graph) - Static method in class org.graphstream.algorithm.Toolkit

Clustering coefficient for each node of the graph.

communities(Graph, String) - Static method in class org.graphstream.algorithm.Toolkit

Return set of nodes grouped by the value of one attribute (the marker).

Community - Class in org.graphstream.algorithm.community

Basic community class.

Community() - Constructor for class org.graphstream.algorithm.community.Community

New community instance with unique identifier.

CommunityDistribution - Class in org.graphstream.algorithm.measure

Provides some statistical information on the size of current community assignment on the specified graph as it evolves.

CommunityDistribution(String) - Constructor for class org.graphstream.algorithm.measure.CommunityDistribution

New size distribution measure using the specified marker as attribute name for the community assignment.

CommunityMeasure - Class in org.graphstream.algorithm.measure

Computes and updates an absolute measure based on the current community assignment on a given graph as it evolves.

CommunityMeasure(String) - Constructor for class org.graphstream.algorithm.measure.CommunityMeasure

New measure algorithm with a given marker for communities.

CommunityRelativeMeasure - Class in org.graphstream.algorithm.measure

Computes and updates a relative measure based on the comparison between the current community assignment and a reference assignment on a given graph.

CommunityRelativeMeasure(String) - Constructor for class org.graphstream.algorithm.measure.CommunityRelativeMeasure

CommunityRelativeMeasure(String, String) - Constructor for class org.graphstream.algorithm.measure.CommunityRelativeMeasure

New comparative measure using "marker" as attribute name for each node current community assignment and "referenceMarker" as attribute name for each node reference assignment.

compareTo(Community) - Method in class org.graphstream.algorithm.community.Community

Comparison method for two Community objects, based on the value of their identfiers.

compute() - Method in class org.graphstream.algorithm.AbstractSpanningTree

compute() - Method in interface org.graphstream.algorithm.Algorithm

Run the algorithm.

compute() - Method in class org.graphstream.algorithm.APSP

Run the APSP computation.

compute() - Method in class org.graphstream.algorithm.AStar

compute(String, String) - Method in class org.graphstream.algorithm.AStar

Call AStar.compute() after having called AStar.setSource(String) and AStar.setTarget(String).

compute() - Method in class org.graphstream.algorithm.BellmanFord

compute() - Method in class org.graphstream.algorithm.BetweennessCentrality

Compute the betweenness centrality on the given graph for each node.

compute() - Method in class org.graphstream.algorithm.Centroid

compute() - Method in class org.graphstream.algorithm.coloring.WelshPowell

compute() - Method in class org.graphstream.algorithm.community.DecentralizedCommunityAlgorithm

Compute an iteration of the algorithm for all the nodes of the network.

compute() - Method in class org.graphstream.algorithm.community.SyncEpidemicCommunityAlgorithm

compute() - Method in class org.graphstream.algorithm.ConnectedComponents

compute() - Method in class org.graphstream.algorithm.Dijkstra

Computes the Dijkstra's algorithm on the given graph starting from the given source node, considering the given attribute locates on the given kind of elements (nodes or edges).

compute() - Method in class org.graphstream.algorithm.Eccentricity

compute() - Method in class org.graphstream.algorithm.measure.CommunityDistribution

compute() - Method in class org.graphstream.algorithm.measure.CommunityMeasure

compute() - Method in class org.graphstream.algorithm.measure.CommunityRelativeMeasure

compute() - Method in class org.graphstream.algorithm.measure.Modularity

compute() - Method in class org.graphstream.algorithm.measure.NormalizedMutualInformation

Compute the new NMI measure value.

compute() - Method in class org.graphstream.algorithm.measure.VariationOfInformation

compute() - Method in class org.graphstream.algorithm.randomWalk.RandomWalk

Execute one step of the algorithm.

compute() - Method in class org.graphstream.ui.layout.Eades84Layout

computeEdgesPasses(boolean) - Method in class org.graphstream.algorithm.randomWalk.RandomWalk

Activate or not the counts on edges when entities cross thems.

computeNode(Node) - Method in class org.graphstream.algorithm.community.DecentralizedCommunityAlgorithm

Perform computation of one iteration of the algorithm on a given node.

computeNode(Node) - Method in class org.graphstream.algorithm.community.EpidemicCommunityAlgorithm

Perform computation of one iteration of the algorithm on a given node using the epidemic label propagation algorithm.

computeNode(Node) - Method in class org.graphstream.algorithm.community.Leung

computeNode(Node) - Method in class org.graphstream.algorithm.community.SyncEpidemicCommunityAlgorithm

computeNodePasses(boolean) - Method in class org.graphstream.algorithm.randomWalk.RandomWalk

Activate or not the counts on nodes when entities cross thems.

ConnectedComponents - Class in org.graphstream.algorithm

Compute and update the number of connected components of a dynamic graph.

ConnectedComponents() - Constructor for class org.graphstream.algorithm.ConnectedComponents

Construction of an instance with no parameter.

ConnectedComponents(Graph) - Constructor for class org.graphstream.algorithm.ConnectedComponents

Constructor with the given graph.

cost(Node, Edge, Node) - Method in interface org.graphstream.algorithm.AStar.Costs

Cost of displacement from parent to next.

cost(Node, Edge, Node) - Method in class org.graphstream.algorithm.AStar.DefaultCosts

The cost of moving from parent to next.

cost(Node, Edge, Node) - Method in class org.graphstream.algorithm.AStar.DistanceCosts

createEntity() - Method in class org.graphstream.algorithm.randomWalk.RandomWalk

Create an entity.

CUBICAL_LCF - Static variable in class org.graphstream.algorithm.generator.lcf.CubicalGraphGenerator

CubicalGraphGenerator - Class in org.graphstream.algorithm.generator.lcf

Build a cubical graph.

CubicalGraphGenerator() - Constructor for class org.graphstream.algorithm.generator.lcf.CubicalGraphGenerator