- DecentralizedCommunityAlgorithm - Class in org.graphstream.algorithm.community
-
Base class for all distributed community detection algorithm.
- DecentralizedCommunityAlgorithm() - Constructor for class org.graphstream.algorithm.community.DecentralizedCommunityAlgorithm
-
Create a new distributed community detection algorithm, without attaching
it to a graph
- DecentralizedCommunityAlgorithm(Graph) - Constructor for class org.graphstream.algorithm.community.DecentralizedCommunityAlgorithm
-
Create a new distributed community detection algorithm, attached to the
specified graph
- DecentralizedCommunityAlgorithm(Graph, String) - Constructor for class org.graphstream.algorithm.community.DecentralizedCommunityAlgorithm
-
Create a new distributed community detection algorithm, attached to the
specified graph, and using the specified marker to store the community
attribute
- declineMatchingURL(String) - Method in class org.graphstream.algorithm.generator.URLGenerator
-
Can be used to filter url.
- decreaseKey(FibonacciHeap<K, V>.Node, K) - Method in class org.graphstream.algorithm.util.FibonacciHeap
-
Decreases the key of a given node
- DEFAULT_ATTRIBUTE_KEY - Static variable in class org.graphstream.algorithm.measure.ClosenessCentrality
-
- DEFAULT_ATTRIBUTE_KEY - Static variable in class org.graphstream.algorithm.measure.DegreeCentrality
-
- DEFAULT_ATTRIBUTE_KEY - Static variable in class org.graphstream.algorithm.measure.EigenvectorCentrality
-
- DEFAULT_DAMPING_FACTOR - Static variable in class org.graphstream.algorithm.PageRank
-
Default damping factor
- DEFAULT_MAX_ITER - Static variable in class org.graphstream.algorithm.measure.EigenvectorCentrality
-
- DEFAULT_PRECISION - Static variable in class org.graphstream.algorithm.PageRank
-
Default precision
- DEFAULT_RANK_ATTRIBUTE - Static variable in class org.graphstream.algorithm.PageRank
-
Default rank attribute
- DEFAULT_WEIGHT_ATTRIBUTE - Static variable in class org.graphstream.algorithm.APSP
-
Default weight attribute
- DEFAULT_WEIGHT_ATTRIBUTE - Static variable in class org.graphstream.algorithm.BellmanFord
-
Default weight attribute
- DEFAULT_WEIGHT_ATTRIBUTE - Static variable in class org.graphstream.algorithm.Kruskal
-
Default weight attribute
- DEFAULT_WEIGHT_ATTRIBUTE - Static variable in class org.graphstream.algorithm.LongestPath
-
Default weight attribute
- DEFAULT_WINDOW_SIZE - Static variable in class org.graphstream.algorithm.measure.ChartSeriesMeasure
-
- DefaultCosts() - Constructor for class org.graphstream.algorithm.AStar.DefaultCosts
-
New default costs for the A* algorithm.
- DefaultCosts(String) - Constructor for class org.graphstream.algorithm.AStar.DefaultCosts
-
New default costs for the A* algorithm.
- defaultMessage() - Method in class org.graphstream.algorithm.BetweennessCentrality
-
- defaultMessage() - Method in class org.graphstream.algorithm.coloring.WelshPowell
-
- defaultMessage() - Method in class org.graphstream.algorithm.community.DecentralizedCommunityAlgorithm
-
- defaultMessage() - Method in class org.graphstream.algorithm.measure.AbstractCentrality
-
- defaultMessage() - Method in class org.graphstream.algorithm.measure.EigenvectorCentrality
-
- defaultMessage() - Method in class org.graphstream.algorithm.measure.Modularity
-
- defaultMessage() - Method in class org.graphstream.algorithm.TarjanStronglyConnectedComponents
-
- defaultResult() - Method in class org.graphstream.algorithm.APSP
-
- defaultResult() - Method in class org.graphstream.algorithm.BellmanFord
-
- defaultResult() - Method in class org.graphstream.algorithm.Centroid
-
- defaultResult() - Method in class org.graphstream.algorithm.ConnectedComponents
-
- defaultResult() - Method in class org.graphstream.algorithm.Dijkstra
-
- defaultResult() - Method in class org.graphstream.algorithm.DStar
-
- defaultResult() - Method in class org.graphstream.algorithm.Eccentricity
-
- defaultResult() - Method in class org.graphstream.algorithm.flow.EdmondsKarpAlgorithm
-
- defaultResult() - Method in class org.graphstream.algorithm.flow.FordFulkersonAlgorithm
-
- defaultResult() - Method in class org.graphstream.algorithm.Kruskal
-
- defaultResult() - Method in class org.graphstream.algorithm.LongestPath
-
- defaultResult() - Method in class org.graphstream.algorithm.measure.SurpriseMeasure
-
- defaultResult() - Method in class org.graphstream.algorithm.PageRank
-
- defaultResult() - Method in class org.graphstream.algorithm.Prim
-
- defaultResult() - Method in class org.graphstream.algorithm.randomWalk.RandomWalk
-
- defaultResult() - Method in class org.graphstream.algorithm.Spectrum
-
- defaultResult() - Method in class org.graphstream.algorithm.TopologicalSortDFS
-
- defaultResult() - Method in class org.graphstream.algorithm.TopologicalSortKahn
-
- degreeAverageDeviation(Graph) - Static method in class org.graphstream.algorithm.Toolkit
-
Returns the value of the degree average deviation of the graph.
- DegreeCentrality - Class in org.graphstream.algorithm.measure
-
- DegreeCentrality() - Constructor for class org.graphstream.algorithm.measure.DegreeCentrality
-
- DegreeCentrality(String, AbstractCentrality.NormalizationMode) - Constructor for class org.graphstream.algorithm.measure.DegreeCentrality
-
Constructor allowing configuration of centrality attribute and
normalization flag.
- DegreeCentrality(String, AbstractCentrality.NormalizationMode, DegreeCentrality.Mode) - Constructor for class org.graphstream.algorithm.measure.DegreeCentrality
-
Same as #DegreeCentrality(String, NormalizationMode) but allows to
configure the mode.
- DegreeCentrality.Mode - Enum in org.graphstream.algorithm.measure
-
- degreeDistribution(Graph) - Static method in class org.graphstream.algorithm.Toolkit
-
Compute the degree distribution of this graph.
- degreeMap(Graph) - Static method in class org.graphstream.algorithm.Toolkit
-
Return a list of nodes sorted by degree, the larger first.
- DegreeMeasure - Class in org.graphstream.algorithm.measure
-
- DegreeMeasure() - Constructor for class org.graphstream.algorithm.measure.DegreeMeasure
-
- density(Graph) - Static method in class org.graphstream.algorithm.Toolkit
-
The density is the number of links in the graph divided by the total
number of possible links.
- DESARGUES_GRAPH_LCF - Static variable in class org.graphstream.algorithm.generator.lcf.DesarguesGraphGenerator
-
LCF notation of a Desargues graph.
- DesarguesGraphGenerator - Class in org.graphstream.algorithm.generator.lcf
-
Build a Desargues graph.
- DesarguesGraphGenerator() - Constructor for class org.graphstream.algorithm.generator.lcf.DesarguesGraphGenerator
-
- diameter(Graph) - Static method in class org.graphstream.algorithm.Toolkit
-
Compute the diameter of the graph.
- diameter(Graph, String, boolean) - Static method in class org.graphstream.algorithm.Toolkit
-
Compute the diameter of the graph.
- Dijkstra - Class in org.graphstream.algorithm
-
Dijkstra's algorithm computes the shortest paths from a given node called
source to all the other nodes in a graph.
- Dijkstra(Dijkstra.Element, String, String) - Constructor for class org.graphstream.algorithm.Dijkstra
-
Constructs an instance with the specified parameters.
- Dijkstra() - Constructor for class org.graphstream.algorithm.Dijkstra
-
Constructs an instance in which the length of the path is considered to
be the number of edges.
- Dijkstra(Dijkstra.Element, String, String, String, Object, Object) - Constructor for class org.graphstream.algorithm.Dijkstra
-
Constructs an instance with the specified parameters.
- Dijkstra.Element - Enum in org.graphstream.algorithm
-
This enumeration is used to specify how the length of a path is computed
- DisjointSets<E> - Class in org.graphstream.algorithm.util
-
This data structure is used to maintain disjoint sets.
- DisjointSets() - Constructor for class org.graphstream.algorithm.util.DisjointSets
-
Creates a new instance containing no sets and no elements
- DisjointSets(int) - Constructor for class org.graphstream.algorithm.util.DisjointSets
-
Creates a new instance containing no sets and no elements.
- distance - Variable in class org.graphstream.algorithm.APSP.TargetPath
-
The distance to this other node.
- DistanceCosts() - Constructor for class org.graphstream.algorithm.AStar.DistanceCosts
-
- DODECAHEDRAL_GRAPH_LCF - Static variable in class org.graphstream.algorithm.generator.lcf.DodecahedralGraphGenerator
-
LCF notation of a dodecahedral graph.
- DodecahedralGraphGenerator - Class in org.graphstream.algorithm.generator.lcf
-
Build a dodecahedral graph.
- DodecahedralGraphGenerator() - Constructor for class org.graphstream.algorithm.generator.lcf.DodecahedralGraphGenerator
-
- DorogovtsevMendesGenerator - Class in org.graphstream.algorithm.generator
-
Dorogovtsev - Mendes graph generator.
- DorogovtsevMendesGenerator() - Constructor for class org.graphstream.algorithm.generator.DorogovtsevMendesGenerator
-
Create a new generator with default random object.
- DorogovtsevMendesGenerator(Random) - Constructor for class org.graphstream.algorithm.generator.DorogovtsevMendesGenerator
-
New generator with the given random number generator.
- DStar - Class in org.graphstream.algorithm
-
An implementation of the D* algorithm.
- DStar() - Constructor for class org.graphstream.algorithm.DStar
-
- DYCK_GRAPH_LCF - Static variable in class org.graphstream.algorithm.generator.lcf.DyckGraphGenerator
-
LCF notation of a Dyck graph.
- DyckGraphGenerator - Class in org.graphstream.algorithm.generator.lcf
-
Build a Dyck graph.
- DyckGraphGenerator() - Constructor for class org.graphstream.algorithm.generator.lcf.DyckGraphGenerator
-
- DynamicAlgorithm - Interface in org.graphstream.algorithm
-
Defines algorithms able to handle dynamics of a graph.
- DynamicOneToAllShortestPath - Class in org.graphstream.algorithm.networksimplex
-
- DynamicOneToAllShortestPath(String) - Constructor for class org.graphstream.algorithm.networksimplex.DynamicOneToAllShortestPath
-