Index

A B C D E F G H I J K L M N O P R S T U V W X Y
All Classes|All Packages

M

main(String...) - Static method in class org.graphstream.algorithm.DStar

main(String...) - Static method in class org.graphstream.algorithm.generator.PointsOfInterestGenerator

main(String...) - Static method in class org.graphstream.algorithm.Spectrum

main(String...) - Static method in class org.graphstream.ui.layout.Eades84Layout

main(String...) - Static method in class org.graphstream.ui.layout.HierarchicalLayout

markPath(String, Object, Object) - Method in class org.graphstream.algorithm.DStar

MAX_1_MIN_0 - org.graphstream.algorithm.measure.AbstractCentrality.NormalizationMode

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

Get the maximum community size

maxLength - Variable in class org.graphstream.algorithm.APSP.APSPInfo

Maximum number of hops to attain another node in the graph from the "from" node.

MaxSimultaneousEdgeCount - Class in org.graphstream.algorithm.measure

A measure to get the maximum count of edges appearing simultaneously in the dynamic graph.

MaxSimultaneousEdgeCount() - Constructor for class org.graphstream.algorithm.measure.MaxSimultaneousEdgeCount

MaxSimultaneousNodeCount - Class in org.graphstream.algorithm.measure

A measure to get the maximum count of nodes appearing simultaneously in the dynamic graph.

MaxSimultaneousNodeCount() - Constructor for class org.graphstream.algorithm.measure.MaxSimultaneousNodeCount

MCGEE_GRAPH_LCF - Static variable in class org.graphstream.algorithm.generator.lcf.McGeeGraphGenerator

LCF notation of a McGee graph.

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

Build a McGee graph.

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

meanDegree() - Method in class org.graphstream.algorithm.generator.RandomFixedDegreeDynamicGraphGenerator

This method computes the mean degree of the graph.

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

Get the minimum community size

minLength - Variable in class org.graphstream.algorithm.APSP.APSPInfo

Minimum number of hops to attain another node in the graph from the "from" node.

MissingParameterException - Exception in org.graphstream.algorithm

A parameter is missing during the processing.

MissingParameterException() - Constructor for exception org.graphstream.algorithm.MissingParameterException

MissingParameterException(String, Object...) - Constructor for exception org.graphstream.algorithm.MissingParameterException

MOBIUS_KANTOR_GRAPH_LCF - Static variable in class org.graphstream.algorithm.generator.lcf.MobiusKantorGraphGenerator

LCF notation of a Mobius-Kantor graph.

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

Build a Mobius-Kantor graph.

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

modularity(double[][]) - Static method in class org.graphstream.algorithm.Toolkit

Compute the modularity of the graph from the E matrix.

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

Computes the modularity as defined by Newman and Girvan in "Finding and evaluating community structure in networks".

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

Computes the weighted modularity.

Modularity - Class in org.graphstream.algorithm.measure

Computes and updates the modularity of a given graph as it evolves.

Modularity() - Constructor for class org.graphstream.algorithm.measure.Modularity

New modularity algorithm using the default marker for communities and no weight on edges.

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

New modularity algorithm with a given marker for communities and no weight on edges.

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

New weighted modularity algorithm with a given marker for communities and the given weightMarker for edge weights.

modularityMatrix(Graph, HashMap<Object, HashSet<Node>>) - Static method in class org.graphstream.algorithm.Toolkit

Create the modularity matrix E from the communities.

modularityMatrix(Graph, HashMap<Object, HashSet<Node>>, String) - Static method in class org.graphstream.algorithm.Toolkit

Create the weighted modularity matrix E from the communities.

MOST_NEGATIVE - org.graphstream.algorithm.networksimplex.NetworkSimplex.PricingStrategy

When using this strategy an iteration is slower, but the number of iterations is generally smaller

moveNode(String, double, double, double) - Method in class org.graphstream.ui.layout.Eades84Layout

moveNode(String, double, double, double) - Method in class org.graphstream.ui.layout.HierarchicalLayout

A B C D E F G H I J K L M N O P R S T U V W X Y
All Classes|All Packages