- Balaban10CageGraphGenerator - Class in org.graphstream.algorithm.generator.lcf
-
Build a Balaban 10-cage graph.
- Balaban10CageGraphGenerator() - Constructor for class org.graphstream.algorithm.generator.lcf.Balaban10CageGraphGenerator
-
- Balaban11CageGraphGenerator - Class in org.graphstream.algorithm.generator.lcf
-
Build a Balaban 11-cage graph.
- Balaban11CageGraphGenerator() - Constructor for class org.graphstream.algorithm.generator.lcf.Balaban11CageGraphGenerator
-
- BALABAN_10CAGE_GRAPH_LCF - Static variable in class org.graphstream.algorithm.generator.lcf.Balaban10CageGraphGenerator
-
LCF notation of a Balaban 10-cage graph.
- BALABAN_11CAGE_GRAPH_LCF - Static variable in class org.graphstream.algorithm.generator.lcf.Balaban11CageGraphGenerator
-
LCF notation of a Balaban 11-cage graph.
- BananaTreeGenerator - Class in org.graphstream.algorithm.generator
-
Banana tree generator.
- BananaTreeGenerator() - Constructor for class org.graphstream.algorithm.generator.BananaTreeGenerator
-
Build a new Banana tree generator with default star size.
- BananaTreeGenerator(int) - Constructor for class org.graphstream.algorithm.generator.BananaTreeGenerator
-
Build a new Banana tree generator composing of k-stars.
- BarabasiAlbertGenerator - Class in org.graphstream.algorithm.generator
-
Scale-free graph generator using the preferential attachment rule as defined
in the Barabási-Albert model.
- BarabasiAlbertGenerator() - Constructor for class org.graphstream.algorithm.generator.BarabasiAlbertGenerator
-
New generator.
- BarabasiAlbertGenerator(int) - Constructor for class org.graphstream.algorithm.generator.BarabasiAlbertGenerator
-
- BarabasiAlbertGenerator(int, boolean) - Constructor for class org.graphstream.algorithm.generator.BarabasiAlbertGenerator
-
- BaseGenerator - Class in org.graphstream.algorithm.generator
-
Base graph generator.
- BaseGenerator() - Constructor for class org.graphstream.algorithm.generator.BaseGenerator
-
New base graph generator.
- BaseGenerator(boolean, boolean) - Constructor for class org.graphstream.algorithm.generator.BaseGenerator
-
New base graph generator.
- BaseGenerator(boolean, boolean, String, String) - Constructor for class org.graphstream.algorithm.generator.BaseGenerator
-
New base graph generator.
- begin() - Method in class org.graphstream.algorithm.generator.BananaTreeGenerator
-
- begin() - Method in class org.graphstream.algorithm.generator.BarabasiAlbertGenerator
-
Start the generator.
- begin() - Method in class org.graphstream.algorithm.generator.ChainGenerator
-
Add an initial node.
- begin() - Method in class org.graphstream.algorithm.generator.ChvatalGenerator
-
- begin() - Method in class org.graphstream.algorithm.generator.DorogovtsevMendesGenerator
-
Init the generator.
- begin() - Method in class org.graphstream.algorithm.generator.FlowerSnarkGenerator
-
- begin() - Method in class org.graphstream.algorithm.generator.FullGenerator
-
Begin the generator by adding a node.
- begin() - Method in interface org.graphstream.algorithm.generator.Generator
-
Begin the graph generation.
- begin() - Method in class org.graphstream.algorithm.generator.GridGenerator
-
Add an initial node.
- begin() - Method in class org.graphstream.algorithm.generator.HypercubeGenerator
-
Creates a hypercube of dimension 0, that is, a single node
- begin() - Method in class org.graphstream.algorithm.generator.IncompleteGridGenerator
-
- begin() - Method in class org.graphstream.algorithm.generator.LCFGenerator
-
- begin() - Method in class org.graphstream.algorithm.generator.LifeGenerator
-
- begin() - Method in class org.graphstream.algorithm.generator.LobsterGenerator
-
- begin() - Method in class org.graphstream.algorithm.generator.PetersenGraphGenerator
-
- begin() - Method in class org.graphstream.algorithm.generator.PointsOfInterestGenerator
-
Add initial count of points of interest, and initial count of people.
- begin() - Method in class org.graphstream.algorithm.generator.PreferentialAttachmentGenerator
-
Deprecated.
Start the generator.
- begin() - Method in class org.graphstream.algorithm.generator.RandomEuclideanGenerator
-
Start the generator.
- begin() - Method in class org.graphstream.algorithm.generator.RandomFixedDegreeDynamicGraphGenerator
-
- begin() - Method in class org.graphstream.algorithm.generator.RandomGenerator
-
Starts the generator.
- begin() - Method in class org.graphstream.algorithm.generator.URLGenerator
-
- begin() - Method in class org.graphstream.algorithm.generator.WattsStrogatzGenerator
-
- BellmanFord - Class in org.graphstream.algorithm
-
Implementation of the Bellman-Ford algorithm that computes single-source
shortest paths in a weighted digraph
The Bellman-Ford algorithm computes single-source shortest paths in a
weighted digraph (where some of the edge weights may be negative).
- BellmanFord() - Constructor for class org.graphstream.algorithm.BellmanFord
-
Build a new BellmanFord algorithm with default parameters.
- BellmanFord(String) - Constructor for class org.graphstream.algorithm.BellmanFord
-
Build a new BellmanFord algorithm giving the name of the weight attribute
for edges.
- BellmanFord(String, String) - Constructor for class org.graphstream.algorithm.BellmanFord
-
- BetweennessCentrality - Class in org.graphstream.algorithm
-
Compute the "betweenness" centrality of each vertex of a given graph.
- BetweennessCentrality() - Constructor for class org.graphstream.algorithm.BetweennessCentrality
-
New centrality algorithm that will perform as if the graph was
unweighted.
- BetweennessCentrality(String) - Constructor for class org.graphstream.algorithm.BetweennessCentrality
-
New centrality algorithm that will perform as if the graph was
unweighted.
- BetweennessCentrality(String, String) - Constructor for class org.graphstream.algorithm.BetweennessCentrality
-
New centrality algorithm that will perform on a weighted graph, taking
the weight of each edge in the given weightAttributeName.
- betweennessCentrality(Graph) - Method in class org.graphstream.algorithm.BetweennessCentrality
-
Compute the betweenness centrality on the given graph for each node and
eventually edges.
- BetweennessCentrality.Progress - Interface in org.graphstream.algorithm
-
Interface allowing to be notified of the algorithm progress.
- BIDIAKIS_CUBE_LCF - Static variable in class org.graphstream.algorithm.generator.lcf.BidiakisCubeGenerator
-
LCF notation of a Bidiakis cube.
- BidiakisCubeGenerator - Class in org.graphstream.algorithm.generator.lcf
-
Build a Bidiakis cube.
- BidiakisCubeGenerator() - Constructor for class org.graphstream.algorithm.generator.lcf.BidiakisCubeGenerator
-
- biggestCommunity() - Method in class org.graphstream.algorithm.measure.CommunityDistribution
-
Get the biggest generated community
- BIGGS_SMITH_GRAPH_LCF - Static variable in class org.graphstream.algorithm.generator.lcf.BiggsSmithGraphGenerator
-
LCF notation of a Biggs-Smith graph.
- BiggsSmithGraphGenerator - Class in org.graphstream.algorithm.generator.lcf
-
Build a Biggs-Smith graph.
- BiggsSmithGraphGenerator() - Constructor for class org.graphstream.algorithm.generator.lcf.BiggsSmithGraphGenerator
-
- binomial(int, double, Random) - Static method in class org.graphstream.algorithm.util.RandomTools
-
Returns a pseudorandom number drawn from binomial distribution B(n, p).
- binomialCoefficient(double, double) - Static method in class org.graphstream.algorithm.measure.SurpriseMeasure
-
Helper to compute the binomial coefficient.
- buildPath(AStar.AStarNode) - Method in class org.graphstream.algorithm.AStar
-
Build the shortest path from the target/destination node, following the
parent links.