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

I

Import - Class in agape.io

This class allows to import files into graph.

Import() - Constructor for class agape.io.Import

incE - Variable in class agape.tutorials.UndirectedGraphFactoryForStringInteger

increase(String) - Method in class agape.test.Tracker

Increase by one the "index" trace.

incV - Variable in class agape.tutorials.UndirectedGraphFactoryForStringInteger

initFactories(Algorithms<String, Integer>, Factory<Graph<String, Integer>>, Factory<String>, Factory<Integer>) - Static method in class agape.applications.AgapeCL

Deprecated.

you must send the factories to the constructor of alogirhtms.

initRole(int) - Method in class agape.algos.MarkMap

IOTutorial - Class in agape.tutorials

IOTutorial() - Constructor for class agape.tutorials.IOTutorial

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

Returns true if a directed graph has no circuit.

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

Tests if a set of vertices is a clique for the Graph G.

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

Return true if the subset C of G contains at least one cycle.

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

Tests if an edge exists between vertices v1 and v2.

isIndependentSet(Graph<V, E>, Set<V>) - Static method in class agape.algos.MIS

This method tests if a set S of a Graph G is an independent set.

isMaximalIndependentSet(Graph<V, E>, Set<V>) - Static method in class agape.algos.MIS

This method tests if a set S of a Graph G is a maximal independent set.

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

Tests if a graph is regular.

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

Tests if a graph is d-regular.

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