A B C D E F G H I J K L M N O P Q R S T U V W

M

main(String[]) - Static method in class agape.applications.AgapeCL

main(String[]) - Static method in class agape.applications.GraphEditor

a driver for this demo

main(String[]) - Static method in class agape.test.AlgoColoringTests

main(String[]) - Static method in class agape.test.AlgoDFVSTests

main(String[]) - Static method in class agape.test.AlgoMISTests

main(String[]) - Static method in class agape.test.AlgoMVCTests

main(String[]) - Static method in class agape.test.DemoAgape

main(String[]) - Static method in class agape.test.ExportSAT

main(String[]) - Static method in class agape.test.MVCCompareAlgorithms

main(String[]) - Static method in class agape.test.Test

main(String[]) - Static method in class agape.tutorials.AlgoColoringTutorial

main(String[]) - Static method in class agape.tutorials.AlgoDFVSTutorial

main(String[]) - Static method in class agape.tutorials.AlgoMISTutorial

main(String[]) - Static method in class agape.tutorials.AlgoMVCTutorial

main(String[]) - Static method in class agape.tutorials.AlgoSeparatorsTutorial

main(String[]) - Static method in class agape.tutorials.CopyGraphTutorial

main(String[]) - Static method in class agape.tutorials.FactoryProblem

main(String[]) - Static method in class agape.tutorials.IOTutorial

main(String[]) - Static method in class agape.tutorials.JungGraphTutorial

main(String[]) - Static method in class agape.tutorials.NRandomGeneratorTutorial

main(String[]) - Static method in class agape.tutorials.RandomGeneratorTutorial

main(String[]) - Static method in class agape.tutorials.UsingFactoriesTutorial

MarkMap<V> - Class in agape.algos

This class is used for Maximum Acyclic Set algorithm (Razgon, 2007).

MarkMap() - Constructor for class agape.algos.MarkMap

MarkMap(MarkMap<V>) - Constructor for class agape.algos.MarkMap

maximalIndependentSetGreedy(Graph<V, E>) - Method in class agape.algos.MIS

This method finds a maximal independent set in a graph using a trivial greedy algorithm.

maximumDirectedAcyclicSubset(Graph<V, E>) - Method in class agape.algos.MinDFVS

Return the Maximum Directed Acyclic Subset of G.

maximumIndependentSetBruteForce(Graph<V, E>) - Method in class agape.algos.MIS

This method returns a maximum independent set of G using the naive brute force algorithm that examines every vertex subset and checks whether it is an independent set, which time complexity is O(n^2.2^n).

maximumIndependentSetMaximumDegree(Graph<V, E>) - Method in class agape.algos.MIS

This method returns a maximum independent set of G by finding vertices with max degrees.

maximumIndependentSetMoonMoser(Graph<V, E>) - Method in class agape.algos.MIS

This method returns a maximum independent set of G based on the Moon and Moser work ("On cliques in graphs" 1965).

maximumIndependentSetMoonMoserNonRecursive(Graph<V, E>) - Method in class agape.algos.MIS

This method is the same as MaximumIndependentSetMM but in a non-recursive version (slower).

maximuRmIndependentSetFominGrandoniKratsch(Graph<V, E>) - Method in class agape.algos.MIS

This method returns a maximum independent set of G based on the Fomin and al.

mergeGraph(Graph<V, E>, Graph<V, E>) - Static method in class agape.tools.Operations

Merge graph subG into G.

MGLtoJungGraph(String) - Static method in class agape.io.Import

Transform a MGL file format (Mascopt) in JUNG graph.

MinDFVS<V,E> - Class in agape.algos

This class is dedicated to the minimum directed feedback vertex set.

MinDFVS(Factory<Graph<V, E>>, Factory<E>) - Constructor for class agape.algos.MinDFVS

minimumFeedbackVertexSet(Graph<V, E>) - Method in class agape.algos.MinDFVS

Computes the minimum directed acyclic subset of the graph G.

MINSEP - Static variable in class agape.test.Tests

MIS<V,E> - Class in agape.algos

This class computes the maximum independ set of a graph (directed or undirected).

MIS(Factory<Graph<V, E>>, Factory<V>, Factory<E>) - Constructor for class agape.algos.MIS

MVC<V,E> - Class in agape.algos

This class implements algorithms for solving the Minimum Vertex Cover problem.

MVC(Factory<Graph<V, E>>) - Constructor for class agape.algos.MVC

MVCCompareAlgorithms - Class in agape.test

MVCCompareAlgorithms() - Constructor for class agape.test.MVCCompareAlgorithms

A B C D E F G H I J K L M N O P Q R S T U V W