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

L

LCF(int, int...) - Constructor for class org.graphstream.algorithm.generator.LCFGenerator.LCF

LCFGenerator - Class in org.graphstream.algorithm.generator

Build a graph using a lcf notation.

LCFGenerator(LCFGenerator.LCF, int, boolean) - Constructor for class org.graphstream.algorithm.generator.LCFGenerator

Build a new graph generator using a LCF notation.

LCFGenerator.LCF - Class in org.graphstream.algorithm.generator

Model a LCF notation.

leavingWeightedDegree(Node, String) - Static method in class org.graphstream.algorithm.Toolkit

Compute the weighted leaving degree of a given node.

leavingWeightedDegree(Node, String, double) - Static method in class org.graphstream.algorithm.Toolkit

Compute the weighted leaving degree of a given node.

Leung - Class in org.graphstream.algorithm.community

This class implements an improved community detection algorithm based on the epidemic label propagation paradigm the was presented by Leung et al.

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

Leung(Graph) - Constructor for class org.graphstream.algorithm.community.Leung

Leung(Graph, double, double) - Constructor for class org.graphstream.algorithm.community.Leung

Create a new Leung algorithm instance, attached to the specified graph, using the default markers for the node community and edge weight attributes.

Leung(Graph, String) - Constructor for class org.graphstream.algorithm.community.Leung

Leung(Graph, String, double, double) - Constructor for class org.graphstream.algorithm.community.Leung

Create a new Leung algorithm instance, attached to the specified graph, using the specified marker to store the community attribute, and the default marker to retrieve the weight attribute of graph edges.

Leung(Graph, String, String) - Constructor for class org.graphstream.algorithm.community.Leung

Create a new Leung algorithm instance, attached to the specified graph, using the specified marker to store the community attribute, and the specified weightMarker to retrieve the weight attribute of graph edges.

Leung(Graph, String, String, double, double) - Constructor for class org.graphstream.algorithm.community.Leung

Create a new Leung algorithm instance, attached to the specified graph, using the specified marker to store the community attribute, and the specified weightMarker to retrieve the weight attribute of graph edges.

LifeGenerator - Class in org.graphstream.algorithm.generator

LifeGenerator(int, int, boolean[]) - Constructor for class org.graphstream.algorithm.generator.LifeGenerator

LifeGenerator(BufferedImage) - Constructor for class org.graphstream.algorithm.generator.LifeGenerator

LifeGenerator(InputStream) - Constructor for class org.graphstream.algorithm.generator.LifeGenerator

LifeGenerator(String) - Constructor for class org.graphstream.algorithm.generator.LifeGenerator

LINE - org.graphstream.algorithm.measure.ChartMeasure.PlotType

Points connected with lines.

LINK_PROBABILITY - org.graphstream.algorithm.generator.PointsOfInterestGenerator.Parameter

LINKS_NEEDED_TO_CREATE_EDGE - org.graphstream.algorithm.generator.PointsOfInterestGenerator.Parameter

LJUBLJANA_GRAPH_LCF - Static variable in class org.graphstream.algorithm.generator.lcf.LjubljanaGraphGenerator

LCF notation of a Ljubljana graph.

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

Build a Ljubljana graph.

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

LobsterGenerator - Class in org.graphstream.algorithm.generator

Generate a Lobster tree.

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

Main constructor to a Lobster generator.

LobsterGenerator(int) - Constructor for class org.graphstream.algorithm.generator.LobsterGenerator

Constructor allowing to customize maximum distance to the root path.

LobsterGenerator(int, int) - Constructor for class org.graphstream.algorithm.generator.LobsterGenerator

Constructor allowing to customize maximum distance to the root path and maximum degree of nodes.

LongestPath - Class in org.graphstream.algorithm

Implementation of longest path algorithm in a DAG (directed acyclic graph) using topologicalSort

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

LOST_INTEREST_PROBABILITY - org.graphstream.algorithm.generator.PointsOfInterestGenerator.Parameter

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