- generateBarabasiAlbertGraph(Factory<Graph<V, E>>, Factory<V>, Factory<E>, int, int, int) - Static method in class agape.generators.RandGenerator
-
This method generates Barabasi-Albert power law graph.
- generateEppsteinGraph(Factory<Graph<V, E>>, Factory<V>, Factory<E>, int, int, int) - Static method in class agape.generators.RandGenerator
-
This method generates Eppstein power law graph.
- generateErdosRenyiGraph(Factory<Graph<V, E>>, Factory<V>, Factory<E>, int, double) - Static method in class agape.generators.RandGenerator
-
- generateGridGraph(Factory<Graph<V, E>>, Factory<V>, Factory<E>, int, int, boolean) - Static method in class agape.generators.NRandGenerator
-
This method generates grid2D graph.
- generateHarderGraph(Graph<V, E>, Factory<Graph<V, E>>, Factory<V>, Factory<E>, int) - Static method in class agape.test.Tests
-
- generateKleinbergSWGraph(Factory<Graph<V, E>>, Factory<V>, Factory<E>, int, int, int, int, double) - Static method in class agape.generators.RandGenerator
-
- generateRandomRegularGraph(Factory<Graph<V, E>>, Factory<V>, Factory<E>, int, int) - Static method in class agape.generators.RandGenerator
-
This method generates a random regular graph.
- generateRegularRing(Factory<Graph<V, E>>, Factory<V>, Factory<E>, int, int) - Static method in class agape.generators.NRandGenerator
-
- generateWattsStrogatzSWGraph(Factory<Graph<V, E>>, Factory<V>, Factory<E>, int, int, double) - Static method in class agape.generators.RandGenerator
-
- get(String) - Method in class agape.test.Tracker
-
Return the amount of times the aimed method passed through a point.
- getABSeparators(Graph<V, E>, V, V) - Method in class agape.algos.Separators
-
Returns the set of minimal ab-separator between vertices a and b in O(n^3) per separator.
- getAllConnectedComponent(Graph<V, E>, Set) - Static method in class agape.tools.Components
-
Same method as getAllConnectedComponent(Graph G) with a set constraint
representing nodes to be excluded.
- getAllConnectedComponent(Graph<V, E>) - Static method in class agape.tools.Components
-
Return all connected components of G.
- getAllDegVertex(Graph<V, E>, int) - Static method in class agape.tools.Operations
-
Retunrs the set of all the vertices of degree 'deg' for the graph G.
- getAllMaxDegVertex(Graph<V, E>) - Static method in class agape.tools.Operations
-
Returns a set containing vertices of G with highest degree.
- getAllMinDegVertex(Graph<V, E>) - Static method in class agape.tools.Operations
-
Returns a set containing vertices of G with lowest degree.
- getAllMinimalSeparators(Graph<V, E>) - Method in class agape.algos.Separators
-
Return all the minimal separators of G.
- getAllStronglyConnectedComponent(Graph<V, E>) - Static method in class agape.tools.Components
-
Returns ALL strongly connected components in a directed graph (Tarjan's algorithm).
- getBMatrix(Graph<V, E>, int) - Static method in class agape.visu.Visualization
-
Returns a 2-dimension array corresponding to the B-Matrix of the graph.
- getComplementGraph(Graph<V, E>, Factory<E>) - Static method in class agape.tools.Components
-
Returns a graph which is the complement of G.
- getConnectedComponent(Graph<V, E>, Set<V>) - Static method in class agape.tools.Components
-
Same method as getConnectedComponent(Graph G) with a set constraint
representing nodes to be excluded.
- getConnectedComponent(Graph<V, E>) - Static method in class agape.tools.Components
-
Return a connected component of G.
- getDegVertex(Graph<V, E>, int) - Static method in class agape.tools.Operations
-
Returns a vertex of degree 'deg' for the graph G.
- getDensity(Graph<V, E>) - Static method in class agape.tools.Operations
-
Returns density of a graph G.
- getDiameter(Graph<V, E>) - Static method in class agape.tools.Operations
-
Returns the diameter of a graph.
- getEdgeFactory() - Method in class agape.algos.Algorithms
-
- getGraphFactory() - Method in class agape.algos.Algorithms
-
- getISetMap() - Method in class agape.algos.MarkMap
-
- getMaxDeg(Graph<V, E>) - Static method in class agape.tools.Operations
-
Returns the maximum degree of G.
- getMaxDegVertex(Graph<V, E>) - Static method in class agape.tools.Operations
-
Returns a vertex of G with maximum degree.
- getMinDeg(Graph<V, E>) - Static method in class agape.tools.Operations
-
Returns the minimum degree of G.
- getMinDegVertex(Graph<V, E>) - Static method in class agape.tools.Operations
-
Returns a vertex of G with minimum degree.
- getNbEdges(Graph<V, E>, Set<V>) - Static method in class agape.tools.Operations
-
Returns the amount of edges which are linking vertices of A.
- getNeighbors(Graph<V, E>, Set<V>) - Static method in class agape.tools.Operations
-
Returns all neighbors of S without S (usually denoted as N(S)).
- getNeighbors(Graph<V, E>, V, int) - Static method in class agape.tools.Operations
-
Returns the neighbors vertices of a set of v at a given distance.
- getVertexCoverSolution() - Method in class agape.algos.MVC
-
Returns the last computed vertex cover set, null if the called
Parameterized algorithms cannot find such a set.
- getVertexFactory() - Method in class agape.algos.Algorithms
-
- getVertices(int) - Method in class agape.algos.MarkMap
-
- getVertices(int, int) - Method in class agape.algos.MarkMap
-
- getVIntMap() - Method in class agape.algos.MarkMap
-
- graphColoring(Graph<V, E>) - Method in class agape.algos.Coloring
-
Returns the chromatic number of a graph G.
- GraphEditor - Class in agape.applications
-
Shows how to create a graph editor with JUNG.
- GraphEditor() - Constructor for class agape.applications.GraphEditor
-
create an instance of a simple graph with popup controls to
create a graph.
- greedyCoverMaxDegree(Graph<V, E>) - Method in class agape.algos.MVC
-
Finds a greedy approximation for a minimal vertex cover of a specified
graph.
- greedyGraphColoring(Graph<V, E>) - Method in class agape.algos.Coloring
-
- greedyMinFVS(Graph<V, E>) - Method in class agape.algos.MinDFVS
-
This method gives an approximation of the FVS problem using Big Degree
heuristic.