All Classes
| Class | Description |
|---|---|
| AbstractCentrality |
Base class for centrality measures.
|
| AbstractCentrality.NormalizationMode | |
| AbstractSpanningTree |
Base for spanning tree algorithms.
|
| Algorithm |
Algorithms are used to compute properties on graphs or graph elements.
|
| AlgorithmComputationTrigger |
Provides a way to trigger the computation of an algorithm according to a type
of events.
|
| AlgorithmComputationTrigger.Mode |
Defines when the computation is triggered.
|
| APSP |
All-pair shortest paths lengths.
|
| APSP.APSPInfo |
Information stored on each node of the graph giving the length of the
shortest paths toward each other node.
|
| APSP.Progress |
Interface allowing to be notified of the algorithm progress.
|
| APSP.TargetPath |
Description of a path to a target node.
|
| AStar |
An implementation of the A* algorithm.
|
| AStar.Costs |
the distance between the current position and the target.
|
| AStar.DefaultCosts |
An implementation of the Costs interface that provides a default
heuristic.
|
| AStar.DistanceCosts |
An implementation of the Costs interface that assume that the weight of
edges is an Euclidean distance in 2D or 3D.
|
| Balaban10CageGraphGenerator |
Build a Balaban 10-cage graph.
|
| Balaban11CageGraphGenerator |
Build a Balaban 11-cage graph.
|
| BananaTreeGenerator |
Banana tree generator.
|
| BarabasiAlbertGenerator |
Scale-free graph generator using the preferential attachment rule as defined
in the Barabási-Albert model.
|
| BaseGenerator |
Base graph generator.
|
| BellmanFord |
Implementation of the Bellman-Ford algorithm that computes single-source
shortest paths in a weighted digraph
|
| BetweennessCentrality |
Compute the "betweenness" centrality of each vertex of a given graph.
|
| BetweennessCentrality.Progress |
Interface allowing to be notified of the algorithm progress.
|
| BidiakisCubeGenerator |
Build a Bidiakis cube.
|
| BiggsSmithGraphGenerator |
Build a Biggs-Smith graph.
|
| Centroid |
Compute the centroid of a connected graph.
|
| ChainGenerator |
Generator for a chain graph of any size.
|
| ChartConnectivityMeasure | |
| ChartConnectivityMeasure.ChartEdgeConnectivityMeasure | |
| ChartConnectivityMeasure.ChartVertexConnectivityMeasure | |
| ChartMeasure |
This is the base for high level measures.
|
| ChartMeasure.PlotException |
Exception that can be raised when trying to plot measures.
|
| ChartMeasure.PlotOutputType |
Defines the support used for rendering : on screen or in a file.
|
| ChartMeasure.PlotParameters |
Parameters defining how to plot measures.
|
| ChartMeasure.PlotType |
Type of plot.s
|
| ChartMinMaxAverageSeriesMeasure |
A measure to plot special entries composed of a minimum, average and maximum
value.
|
| ChartSeries1DMeasure |
A measure to add 1D entries (y). x is auto-incremented by one at each new
value.
|
| ChartSeries2DMeasure |
A measure allowing to add 2D entries (x,y).
|
| ChartSeriesMeasure |
Base for series measure.
|
| ChvatalGenerator |
Generate the Chvatal graph.
|
| ClosenessCentrality |
Compute closeness centrality.
|
| Community |
Basic community class.
|
| CommunityDistribution |
Provides some statistical information on the size of current community
assignment on the specified graph as it evolves.
|
| CommunityMeasure |
Computes and updates an absolute measure based on the current community
assignment on a given graph as it evolves.
|
| CommunityRelativeMeasure |
Computes and updates a relative measure based on the comparison between the
current community assignment and a reference assignment on a given graph.
|
| ConnectedComponents |
Compute and update the number of connected components of a dynamic graph.
|
| ConnectivityMeasure |
Get the vertex-connectivity of a graph.
|
| ConnectivityMeasure.EdgeConnectivityMeasure | |
| ConnectivityMeasure.VertexConnectivityMeasure | |
| CubicalGraphGenerator |
Build a cubical graph.
|
| DecentralizedCommunityAlgorithm |
Base class for all distributed community detection algorithm.
|
| DegreeCentrality | |
| DegreeCentrality.Mode | |
| DegreeMeasure | |
| DesarguesGraphGenerator |
Build a Desargues graph.
|
| Dijkstra |
Dijkstra's algorithm computes the shortest paths from a given node called
source to all the other nodes in a graph.
|
| Dijkstra.Element |
This enumeration is used to specify how the length of a path is computed
|
| DisjointSets<E> |
This data structure is used to maintain disjoint sets.
|
| DodecahedralGraphGenerator |
Build a dodecahedral graph.
|
| DorogovtsevMendesGenerator |
Dorogovtsev - Mendes graph generator.
|
| DStar |
An implementation of the D* algorithm.
|
| DyckGraphGenerator |
Build a Dyck graph.
|
| DynamicAlgorithm |
Defines algorithms able to handle dynamics of a graph.
|
| DynamicOneToAllShortestPath | |
| Eades84Layout | |
| Eccentricity |
Compute the eccentricity of a connected graph.
|
| EdmondsKarpAlgorithm | |
| EigenvectorCentrality | |
| ElementCountMeasure | |
| ElementCountMeasure.EdgeCountMeasure |
Measure the count of edges in a graph.
|
| ElementCountMeasure.NodeCountMeasure |
Measure the count of nodes in a graph.
|
| Entity |
A base entity for the
RandomWalk algorithm. |
| EpidemicCommunityAlgorithm |
This class implements the "Epidemic Community Detection Algorithm" as
presented by Raghavan et al.
|
| F26AGraphGenerator |
Build a F26A graph.
|
| FibonacciHeap<K extends Comparable<K>,V> |
Fibonacci heap is a data structure used mainly to implement priority queues.
|
| FixedArrayList<E> |
Array list with immutable element indices.
|
| FlowAlgorithm |
Defines algorithm used to compute maximum flow.
|
| FlowAlgorithmBase |
Base for flow algorithms.
|
| FlowerSnarkGenerator |
Flower snark generator.
|
| FordFulkersonAlgorithm |
The Ford-Fulkerson algorithm to compute maximum flow.
|
| FosterGraphGenerator |
Build a Foster graph.
|
| FranklinGraphGenerator |
Build a Franklin graph.
|
| FruchtGraphGenerator |
Build a Frucht graph.
|
| FullGenerator |
Full graph generator.
|
| Generator |
Graph generator.
|
| GrayGraphGenerator |
Build a Gray graph.
|
| GridGenerator |
Generator for square grids of any size.
|
| HarriesGraphGenerator |
Build a Harries graph.
|
| HarriesWongGraphGenerator |
Build a Harries-Wong graph.
|
| HeawoodGraphGenerator |
Build a Heawood graph.
|
| HierarchicalLayout | |
| HierarchicalLayout.Rendering | |
| HypercubeGenerator |
Generates a hypercube of dimension equal to the number of calls to
HypercubeGenerator.nextEvents(). |
| IncompleteGridGenerator |
A grid generator with holes.
|
| InvalidParameterException | |
| Kruskal |
Compute a spanning tree using the Kruskal algorithm.
|
| LCFGenerator |
Build a graph using a lcf notation.
|
| LCFGenerator.LCF |
Model a LCF notation.
|
| Leung |
This class implements an improved community detection algorithm based on the
epidemic label propagation paradigm the was presented by Leung et al.
|
| LifeGenerator | |
| LjubljanaGraphGenerator |
Build a Ljubljana graph.
|
| LobsterGenerator |
Generate a Lobster tree.
|
| LongestPath |
Implementation of longest path algorithm in a DAG (directed acyclic graph) using topologicalSort
|
| MaxSimultaneousEdgeCount |
A measure to get the maximum count of edges appearing simultaneously in the
dynamic graph.
|
| MaxSimultaneousNodeCount |
A measure to get the maximum count of nodes appearing simultaneously in the
dynamic graph.
|
| McGeeGraphGenerator |
Build a McGee graph.
|
| MissingParameterException |
A parameter is missing during the processing.
|
| MobiusKantorGraphGenerator |
Build a Mobius-Kantor graph.
|
| Modularity |
Computes and updates the modularity of a given graph as it evolves.
|
| NauruGraphGenerator |
Build a Nauru graph.
|
| NetworkSimplex |
Minimum cost flow problem
|
| NetworkSimplex.ArcStatus |
Arc status
|
| NetworkSimplex.PricingStrategy |
Pricing strategy used at each iteration of the algorithm.
|
| NetworkSimplex.SolutionStatus |
The status of the current solution.
|
| NormalizedMutualInformation |
Computes and updated the current Normalized Mutual Information (NMI) measure
between a dynamically-performed community assignment on a graph as it evolves
and a fixed assignment, known as reference.
|
| NotInitializedException | |
| PageRank |
The PageRank is an algorithm that measures the "importance" of the nodes in a
graph.
|
| PappusGraphGenerator |
Build a Pappus graph.
|
| Parameter | |
| PetersenGraphGenerator |
Generate a Petersen graph.
|
| PointsOfInterestGenerator |
Generate a social dynamic graph.
|
| PointsOfInterestGenerator.Parameter | |
| PreferentialAttachmentGenerator | Deprecated. |
| Prim |
Compute a spanning tree using the Prim algorithm.
|
| RandomEuclideanGenerator |
Random Euclidean graph generator.
|
| RandomFixedDegreeDynamicGraphGenerator |
This is a graph generator that generates dynamic random graphs.
|
| RandomGenerator |
Random graph generator.
|
| RandomTools |
This class provides several static methods for generating random numbers and
sets
|
| RandomWalk |
A random walk on a graph.
|
| Result | |
| SpanningTree |
This interface defines the basic functionalities of a spanning tree algorithm.
|
| Spectrum | |
| Spectrum.EigenValuesAlgorithm | |
| SurpriseMeasure |
Surprise measure.
|
| SyncEpidemicCommunityAlgorithm |
This class implements the synchronous version of the
"Epidemic Community Detection Algorithm" as presented by Raghavan et
al.
|
| TabuEntity |
A basic entity that chooses edges at random eventually
avoiding some edges based on a memory of recently traversed
edges.
|
| TarjanStronglyConnectedComponents |
Tarjan's Algorithm is a graph theory algorithm for finding the strongly
connected components of a graph.
|
| TarjanStronglyConnectedComponents.IndexGenerator |
Defines objects able to generator index.
|
| TarjanStronglyConnectedComponents.IntegerIndexGenerator |
Defines an index generator producing a sequence of integer as indexes.
|
| TetrahedralGraphGenerator |
Generate a tetrahedral graph.
|
| Toolkit |
Lots of small often used algorithms on graphs.
|
| TopologicalSortDFS |
Implementation of depth first search algorithm for a topological sorting of a directed acyclic graph (DAG).
|
| TopologicalSortKahn |
Implementation of Kahn's algorithm for a topological sorting of a directed acyclic graph (DAG).
|
| TruncatedCubicalGraphGenerator |
Build a truncated cubical graph.
|
| TruncatedDodecahedralGraphGenerator |
Build a truncated dodecahedral graph.
|
| TruncatedOctahedralGraphGenerator |
Build a truncated octahedral graph.
|
| TruncatedTetrahedralGraphGenerator |
Build a truncated tetrahedral graph.
|
| Tutte12CageGraphGenerator |
Build a Tutte 12-cage graph.
|
| TutteCoxeterGraphGenerator |
Build a Tutte-Coxeter graph.
|
| URLGenerator |
Generate a graph using the web.
|
| URLGenerator.Mode | |
| URLGenerator.URLFilter |
Defines url filter.
|
| UtilityGraphGenerator |
Build a utility graph.
|
| VariationOfInformation | |
| WagnerGraphGenerator |
Build a Wagner graph.
|
| WattsStrogatzGenerator |
A generator following the small-world model of Watts and Strogatz.
|
| WelshPowell |
Welsh Powell static graph coloring algorithm.
|
| WikipediaGenerator | |
| WikipediaGenerator.Lang |