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

A

abs() - Method in class fr.inria.opengve.bridge.abstractClasses.AbstractScalar

Set the value this AbstractScalar to the absolute value of this AbstractScalar.

AbstractScalar - Class in fr.inria.opengve.bridge.abstractClasses

This Class is used everywhere numerics computations must be done without specify the type of the of the scalar.

AbstractScalar() - Constructor for class fr.inria.opengve.bridge.abstractClasses.AbstractScalar

add(AbstractScalar) - Method in class fr.inria.opengve.bridge.abstractClasses.AbstractScalar

Add an AbstractScalar to this object.

addEdge(V, V) - Method in interface fr.inria.opengve.bridge.interfaces.Graph

Add operation of the edge

addEdge(E) - Method in interface fr.inria.opengve.bridge.interfaces.Graph

Add operation of the edge

addFlow(Flow<V, A>) - Method in interface fr.inria.opengve.bridge.interfaces.MultiFlow

Add a given flow to this multi-flow.

addVertex(V) - Method in interface fr.inria.opengve.bridge.interfaces.Graph

Add an vertex to the graph.

Arc<E> - Interface in fr.inria.opengve.bridge.interfaces

As implied by its name, this interface models the mathematical arc abstraction, which can be viewed as a directed link.

AugmentingPath<V,E extends Link<V>,G extends Graph<V,E>> - Class in fr.inria.opengve.bridge.algorithms.common

This class construct augmenting path on a graph.

AugmentingPath(G) - Constructor for class fr.inria.opengve.bridge.algorithms.common.AugmentingPath

Constructor of AugmentingPath flow algorithm.

B

BellmanFord<V,E extends Link<V>,G extends Graph<V,E>> - Class in fr.inria.opengve.bridge.algorithms.common.shortestPath

This class implement the Bellman-Ford algorithm.

BellmanFord(G, boolean) - Constructor for class fr.inria.opengve.bridge.algorithms.common.shortestPath.BellmanFord

Constructor.

BellmanFord(G) - Constructor for class fr.inria.opengve.bridge.algorithms.common.shortestPath.BellmanFord

Constructor.

C

checkProprieties(Graph<V, L>, GraphUtility.Propriety...) - Static method in class fr.inria.opengve.bridge.algorithms.GraphUtility

Check if a graph have a given list of properties.

clear() - Method in interface fr.inria.opengve.bridge.interfaces.Map

Clear the content of this Map

clone() - Method in class fr.inria.opengve.bridge.abstractClasses.AbstractScalar

complement() - Method in interface fr.inria.opengve.bridge.interfaces.Graph

Returns the complement of this graph.

compute() - Method in class fr.inria.opengve.bridge.algorithms.undirected.minCut.StoerWagnerMinCut

Give the value of the minimal cut.

computeProbability(E, Vector<E>) - Method in class fr.inria.opengve.bridge.algorithms.common.RandomWalk

This method give the probability of each edge present in a given vector.

computeShortestPath() - Method in class fr.inria.opengve.bridge.algorithms.common.shortestPath.FloydWarshall

Compute shortest path for any cuple of vertices and say if cycle of negative distance was found.

computeShortestPath(V, V, int) - Method in class fr.inria.opengve.bridge.algorithms.common.shortestPath.KShortestPaths

Compute k shortest path between s and t.

concat(Path<V, E>) - Method in interface fr.inria.opengve.bridge.interfaces.Path

Concat the path p to this path.

concat(E) - Method in interface fr.inria.opengve.bridge.interfaces.Path

Concat the edge e to this path.

contains(V) - Method in interface fr.inria.opengve.bridge.interfaces.Cycle

Tell if this cycle contains a given vertex.

contains(E) - Method in interface fr.inria.opengve.bridge.interfaces.Cycle

Tell if this cycle contains a given edge.

contains(V) - Method in interface fr.inria.opengve.bridge.interfaces.Link

Answers whether the link contains the specified object as one of its vertices.

contains(Object, String) - Method in interface fr.inria.opengve.bridge.interfaces.Map

Say if an entry exist in this Map corresponding to a given principal key and name using default context.

contains(Object, String, Object) - Method in interface fr.inria.opengve.bridge.interfaces.Map

Say if an entry exist in this Map corresponding to a given principal key,name and context.

contains(Object) - Method in interface fr.inria.opengve.bridge.interfaces.Map

Say if an object is a principal key.

contains(V) - Method in interface fr.inria.opengve.bridge.interfaces.Path

Tell if this path contain the vertex o.

contains(E) - Method in interface fr.inria.opengve.bridge.interfaces.Path

Tell if this path contain the edge e.

contextsIterator(Object, String) - Method in interface fr.inria.opengve.bridge.interfaces.Map

Give an Iterator on all contexts assiated with a given principal key and name.

contextsIterator(Object) - Method in interface fr.inria.opengve.bridge.interfaces.Map

Returns an iterator on all contexts associated with a principal key.

CopyGraph<V,E extends Link<V>,G extends Graph<V,E>> - Class in fr.inria.opengve.bridge.algorithms.common

This class is the bridge abstract impelmentation of graph copy.

CopyGraph() - Constructor for class fr.inria.opengve.bridge.algorithms.common.CopyGraph

copyGraph(G) - Method in class fr.inria.opengve.bridge.algorithms.common.CopyGraph

Make a copy of one graph.

copyGraph(Graph<V, E>) - Method in class fr.inria.opengve.bridge.algorithms.undirected.minCut.StoerWagnerMinCut

Get a copy of the given graph.

copyGraphInGraph(Graph<V, L>, Graph<V, L>) - Static method in class fr.inria.opengve.bridge.algorithms.GraphUtility

This method must return a subset-free copy of the graph.

CopyPath<V,E extends Link<V>> - Class in fr.inria.opengve.bridge.algorithms.common

This class is the bridge implememtation of path copy.

CopyPath() - Constructor for class fr.inria.opengve.bridge.algorithms.common.CopyPath

copyPath(Path<V, E>) - Method in class fr.inria.opengve.bridge.algorithms.common.CopyPath

Copy the path p.

createArc(V, V) - Method in class fr.inria.opengve.bridge.algorithms.directed.EdmondsKarp

Create a new Arc.

createAugmentingPath(G) - Method in class fr.inria.opengve.bridge.algorithms.directed.EdmondsKarp

Create a new AugmentingPath.

createCopier() - Method in class fr.inria.opengve.bridge.algorithms.undirected.minCut.NagamochiMinCut

Create a graph copier

createCopyGraph() - Method in class fr.inria.opengve.bridge.algorithms.common.FindElementaryCycles

Create a new copy tool.

createCopyGraph() - Method in class fr.inria.opengve.bridge.algorithms.common.shortestPath.KShortestPaths

Create a new copy tool.

createCycle(Path<V, E>, E) - Method in class fr.inria.opengve.bridge.algorithms.common.FindElementaryCyclesFrom

Create a new cycle from a path and the edge closing this path.

createDijkstraAdvanced(G, V) - Method in class fr.inria.opengve.bridge.algorithms.common.shortestPath.KShortestPaths

Create an algorithms that compute shortest path between source and destination.

createDirectedPath() - Method in class fr.inria.opengve.bridge.algorithms.directed.ExtractFlow

Give a new empty directed path.

createEdge(V, V) - Method in class fr.inria.opengve.bridge.algorithms.undirected.minCut.NagamochiMinCut

Create a new edge

createEdgeSet(HierarchicalSet<V>) - Method in class fr.inria.opengve.bridge.algorithms.common.CopyGraph

Create a new empty edgeSet.

createEmptyGraph() - Method in class fr.inria.opengve.bridge.algorithms.undirected.minCut.NagamochiMinCut

Create a new empty graph

createEmptySet() - Method in class fr.inria.opengve.bridge.algorithms.undirected.minCut.NagamochiMinCut

Create a new empty edge set (based on an empty vertex set)

createEmptyVertexSet() - Method in class fr.inria.opengve.bridge.algorithms.undirected.minCut.NagamochiMinCut

Create a new empty vertex set

createFindElementaryCyclesFrom(G, V, Map, AbstractScalar) - Method in class fr.inria.opengve.bridge.algorithms.common.FindElementaryCycles

Create a new object of type FindElementaryCyclesFrom.

createFlow(Graph<V, A>) - Method in class fr.inria.opengve.bridge.algorithms.directed.ExtractFlow

Create a new empty flow.

createGraph(HierarchicalSet<E>) - Method in class fr.inria.opengve.bridge.algorithms.common.CopyGraph

Create a new graph.

createGraph(HierarchicalSet<V>) - Method in class fr.inria.opengve.bridge.algorithms.directed.EdmondsKarp

Create a new empty graph based on a given vertex set.

createGraph(G) - Method in class fr.inria.opengve.bridge.algorithms.undirected.Kruskal

Create a new empty subgraph of a given graph.

createGraph(Graph<V, E>) - Method in class fr.inria.opengve.bridge.algorithms.undirected.PrimST

Create a new empty graph sub graph of a given garph.

createInteger(int) - Method in class fr.inria.opengve.bridge.algorithms.common.AugmentingPath

Create a new AbstractScalar (Integer type).

createIntegerScalar(int) - Method in class fr.inria.opengve.bridge.algorithms.common.FindElementaryCyclesFrom

Create a new AbstractScalar of type int.

createMap() - Method in class fr.inria.opengve.bridge.algorithms.common.shortestPath.ShortestPathWithSingleOrigin

This method is used to create a new Map

createOne() - Method in class fr.inria.opengve.bridge.algorithms.undirected.minCut.StoerWagnerMinCut

Create an abstract scalar with a value one.

createPath() - Method in class fr.inria.opengve.bridge.algorithms.common.AugmentingPath

Create a new empty path of the same type that graph g.

createPath() - Method in class fr.inria.opengve.bridge.algorithms.common.CopyPath

Create an empty path.

createPath() - Method in class fr.inria.opengve.bridge.algorithms.common.FindElementaryCyclesFrom

Create a new Path.

createPath() - Method in class fr.inria.opengve.bridge.algorithms.common.RandomWalk

Create a new empty path.

createPath() - Method in class fr.inria.opengve.bridge.algorithms.common.shortestPath.Dijkstra

Method to create Path.

createPath() - Method in class fr.inria.opengve.bridge.algorithms.common.shortestPath.FloydWarshall

Create a new empty path of the same type(directed or undirected) than the graph on which is applied this algorithms.

createPath() - Method in class fr.inria.opengve.bridge.algorithms.common.shortestPath.KShortestPaths

Create a new path.

createPath() - Method in class fr.inria.opengve.bridge.algorithms.common.shortestPath.ShortestPathWithSingleOrigin

This method is used to create Path

createScalar(int) - Method in class fr.inria.opengve.bridge.algorithms.common.shortestPath.Dijkstra

Create a new AbstractScalar of a given value.

createSTFlow(G) - Method in class fr.inria.opengve.bridge.algorithms.directed.EdmondsKarp

Return a new empty flow.

createSubEdgeSet(HierarchicalSet<E>) - Method in class fr.inria.opengve.bridge.algorithms.common.CopyGraph

Create a new empty edgeSet subset of a given edge set.

createVertexSet() - Method in class fr.inria.opengve.bridge.algorithms.common.CopyGraph

Create a new empty vertexSet.

createVertexSet(HierarchicalSet<V>) - Method in class fr.inria.opengve.bridge.algorithms.common.CopyGraph

Create a new empty vertexSet subset of a given vertex set.

createVertexSet(HierarchicalSet<V>) - Method in class fr.inria.opengve.bridge.algorithms.common.shortestPath.Dijkstra

Method to create intermediate vertexSet.

Cycle<V,E extends Link<V>> - Interface in fr.inria.opengve.bridge.interfaces

Cycle is define as an undirected path in which : The first and the last vertex are identical An edge is only present one time

D

destinationIterator() - Method in interface fr.inria.opengve.bridge.interfaces.MultiFlow

Give an iterator on the destination vertex of this multi-flow.

Dijkstra<V,E extends Link<V>,G extends Graph<V,E>> - Class in fr.inria.opengve.bridge.algorithms.common.shortestPath

Provides a simple algorithm to find distance from a vertex and the paths corresponding to this vertex.

Dijkstra(G, Map) - Constructor for class fr.inria.opengve.bridge.algorithms.common.shortestPath.Dijkstra

Default constructor.

Dijkstra(G, Map, boolean) - Constructor for class fr.inria.opengve.bridge.algorithms.common.shortestPath.Dijkstra

Default constructor.

DijkstraAdvanced<V,E extends Link<V>,G extends Graph<V,E>> - Class in fr.inria.opengve.bridge.algorithms.common.shortestPath

Provides a advanced algorithm to find all shortest paths from a vertex.

DijkstraAdvanced(G) - Constructor for class fr.inria.opengve.bridge.algorithms.common.shortestPath.DijkstraAdvanced

Classic Dijkstra constructor.

DijkstraAdvanced(G, boolean) - Constructor for class fr.inria.opengve.bridge.algorithms.common.shortestPath.DijkstraAdvanced

This constructor permit to specify if algorithm must run in stepMode.

DijkstraAdvanced(G, boolean, V) - Constructor for class fr.inria.opengve.bridge.algorithms.common.shortestPath.DijkstraAdvanced

This constructor is used to do optimized computation when you want to compute shortest path between two vertices.

DIJKSTRADISTANCE - Variable in class fr.inria.opengve.bridge.algorithms.common.shortestPath.Dijkstra

The string which identify the value to consider as the distance on edges.

disconnect() - Method in interface fr.inria.opengve.bridge.interfaces.HierarchicalSet

Disconnects this set of its superset.

divide(AbstractScalar) - Method in class fr.inria.opengve.bridge.abstractClasses.AbstractScalar

Divide this object by an AbstractScalar.

E

Edge<V> - Interface in fr.inria.opengve.bridge.interfaces

/** As implied by its name, this interface models the mathematical edge abstraction, which can be viewed as an undirected link.

edgeIterator() - Method in interface fr.inria.opengve.bridge.interfaces.Cycle

Give an Iterator on the edges of this cycle.

edgeIterator(E) - Method in interface fr.inria.opengve.bridge.interfaces.Cycle

Give an Iterator on the edges of this cycle.

edgeIterator(V) - Method in interface fr.inria.opengve.bridge.interfaces.Path

Give an iterator on the Link of the path.

edgeSet() - Method in interface fr.inria.opengve.bridge.interfaces.Graph

Returns a set view of the edges of this graph.

edgeWithFlowIterator() - Method in interface fr.inria.opengve.bridge.interfaces.Flow

Give an iterator on all edge of this flows.

edgeWithFlowIterator() - Method in interface fr.inria.opengve.bridge.interfaces.MultiFlow

Give a Iterator on all edges with a flow not null.

EdmondsKarp<V,A extends Arc<V>,G extends Graph<V,A>> - Class in fr.inria.opengve.bridge.algorithms.directed

This algorithms is the implementation of the Edmonds-Karp version of the Ford-Fulkerson algorithms.

EdmondsKarp(G, Map) - Constructor for class fr.inria.opengve.bridge.algorithms.directed.EdmondsKarp

Constructor.

EdmondsKarp(G, Map, boolean) - Constructor for class fr.inria.opengve.bridge.algorithms.directed.EdmondsKarp

ends() - Method in class fr.inria.opengve.bridge.algorithms.StepAlgo

Indicate that this algorithm is terminated.

exp() - Method in class fr.inria.opengve.bridge.abstractClasses.AbstractScalar

Set the value of this AbstractScalar to the exponential value of this AbstractScalar.

ExtractFlow<V,A extends Arc<V>> - Class in fr.inria.opengve.bridge.algorithms.directed

This class extract STFlow from a single source multiple destination flow.

ExtractFlow(Graph<V, A>, V, Flow<V, A>) - Constructor for class fr.inria.opengve.bridge.algorithms.directed.ExtractFlow

Constructor.

F

finalize() - Method in class fr.inria.opengve.bridge.algorithms.common.shortestPath.ShortestPathWithSingleOrigin

FindElementaryCycles<V,E extends Link<V>,G extends Graph<V,E>> - Class in fr.inria.opengve.bridge.algorithms.common

This algorithms compute all the elementary cycles on a graph.

FindElementaryCycles(G, Map, AbstractScalar) - Constructor for class fr.inria.opengve.bridge.algorithms.common.FindElementaryCycles

Constructor.

FindElementaryCycles(G, AbstractScalar) - Constructor for class fr.inria.opengve.bridge.algorithms.common.FindElementaryCycles

This Constructor initialize algorithms with a cost of one on each edges.

FindElementaryCyclesFrom<V,E extends Link<V>,G extends Graph<V,E>> - Class in fr.inria.opengve.bridge.algorithms.common

This class compute all cycles of a graph containing a specific vertex.

FindElementaryCyclesFrom(G, V, Map, AbstractScalar) - Constructor for class fr.inria.opengve.bridge.algorithms.common.FindElementaryCyclesFrom

Constructor.

FindElementaryCyclesFrom(G, V, AbstractScalar) - Constructor for class fr.inria.opengve.bridge.algorithms.common.FindElementaryCyclesFrom

Constructor

Flow<V,A extends Arc<V>> - Interface in fr.inria.opengve.bridge.interfaces

This interface is used to manage flow.

flowName - Static variable in class fr.inria.opengve.bridge.algorithms.directed.EdmondsKarp

The name used during the execution of algorithms for storing flow.

FloydWarshall<V,E extends Link<V>,G extends Graph<V,E>> - Class in fr.inria.opengve.bridge.algorithms.common.shortestPath

This class is the implementation of the Floyd-Warshall algorithms.

FloydWarshall(G) - Constructor for class fr.inria.opengve.bridge.algorithms.common.shortestPath.FloydWarshall

Algorithm constructor.

foundNegativeCycle() - Method in class fr.inria.opengve.bridge.algorithms.common.shortestPath.BellmanFord

This method say if negative cycles are present in the graph.

fr.inria.opengve.bridge.abstractClasses - package fr.inria.opengve.bridge.abstractClasses

fr.inria.opengve.bridge.algorithms - package fr.inria.opengve.bridge.algorithms

fr.inria.opengve.bridge.algorithms.common - package fr.inria.opengve.bridge.algorithms.common

This package contains all algorithms common to directed and undirected graph.

fr.inria.opengve.bridge.algorithms.common.shortestPath - package fr.inria.opengve.bridge.algorithms.common.shortestPath

fr.inria.opengve.bridge.algorithms.directed - package fr.inria.opengve.bridge.algorithms.directed

This package contains all algorithms specific to directed graph.

fr.inria.opengve.bridge.algorithms.undirected - package fr.inria.opengve.bridge.algorithms.undirected

This package contains all algorithms specific to undirected graph.

fr.inria.opengve.bridge.algorithms.undirected.minCut - package fr.inria.opengve.bridge.algorithms.undirected.minCut

fr.inria.opengve.bridge.interfaces - package fr.inria.opengve.bridge.interfaces

This package contains interfaces defining graph management.

G

g_ - Variable in class fr.inria.opengve.bridge.algorithms.common.shortestPath.ShortestPathWithSingleOrigin

The graph on which is the algorithms is applied.

getBestPath(V, V) - Method in class fr.inria.opengve.bridge.algorithms.common.AugmentingPath

Return the shortest path (in term of cost) with the maximum quantity of flow.

getCycles() - Method in class fr.inria.opengve.bridge.algorithms.common.FindElementaryCyclesFrom

Return the set of cycles containing the given node.

getDataType(Object, String) - Method in interface fr.inria.opengve.bridge.interfaces.Map

Returns the data type of the value associated with a principal key, a given name and the default context.

getDataType(Object, String, Object) - Method in interface fr.inria.opengve.bridge.interfaces.Map

Returns the data type of the value associated with a principal key, a given name and a context.

getDemoMode() - Method in class fr.inria.opengve.bridge.algorithms.StepAlgo

Say if the algorithm is in demo mode ie step by step.

getDestination() - Method in interface fr.inria.opengve.bridge.interfaces.Flow

Give the destination of this flow.

getDestinationSet() - Method in class fr.inria.opengve.bridge.algorithms.directed.EdmondsKarp

Returns the subSet of vertices that are chunked with the destination

getDistance(V, V) - Method in class fr.inria.opengve.bridge.algorithms.common.shortestPath.FloydWarshall

Give the distance of shortest path beetween two vertices.

getDistance(int) - Method in class fr.inria.opengve.bridge.algorithms.common.shortestPath.KShortestPaths

Returns the weight of the k-th path.

getDistanceContext() - Method in class fr.inria.opengve.bridge.algorithms.common.shortestPath.ShortestPathWithSingleOrigin

Give the context used to load distance of edges in the map.

getDistanceMap() - Method in class fr.inria.opengve.bridge.algorithms.common.shortestPath.ShortestPathWithSingleOrigin

Return the map where distance are stored.

getDistanceName() - Method in class fr.inria.opengve.bridge.algorithms.common.shortestPath.ShortestPathWithSingleOrigin

Give the name used to load distance of edges in the map.

getDistances() - Method in class fr.inria.opengve.bridge.algorithms.common.shortestPath.Dijkstra

Returns the hashtable giving distances.

getDistanceTo(Object) - Method in class fr.inria.opengve.bridge.algorithms.common.shortestPath.Dijkstra

Returns the distance from source of a node.

getDistanceTo(Object) - Method in class fr.inria.opengve.bridge.algorithms.common.shortestPath.ShortestPathWithSingleOrigin

Give the distance of the shortest path to a given vertex.

getEdgeMinCut() - Method in class fr.inria.opengve.bridge.algorithms.undirected.minCut.NagamochiMinCut

Give the minimum cut of the graph as a edge set.

getEdges(V) - Method in interface fr.inria.opengve.bridge.interfaces.Cycle

Returns the two edges containing the given vertex in a 2-elements array where one edge is placed in the first position (index 0) and the other edge occupies the second position (index 1).

getEdges(V) - Method in interface fr.inria.opengve.bridge.interfaces.Path

Give the Link connected to one vertex.

getEdgesConnected(V, V) - Method in interface fr.inria.opengve.bridge.interfaces.Graph

Construct a HierarchicalSet containing the edges leading from v1 to v2.

getEnds() - Method in interface fr.inria.opengve.bridge.interfaces.Path

Give the ends of the path.

getFirstVertex() - Method in interface fr.inria.opengve.bridge.interfaces.Path

Return the first vertex of an oriented Path.

getFlow() - Method in class fr.inria.opengve.bridge.algorithms.common.AugmentingPath

Return the value of flow of the last retured path.

getFlow() - Method in class fr.inria.opengve.bridge.algorithms.directed.EdmondsKarp

Return the flow that goes from source to destination.

getFlow(A) - Method in interface fr.inria.opengve.bridge.interfaces.Flow

Give the quantity of flow associated with an edge.

getFlow(A) - Method in interface fr.inria.opengve.bridge.interfaces.MultiFlow

Give the quantity of flow associated with an edge.

getFlow(V, V) - Method in interface fr.inria.opengve.bridge.interfaces.MultiFlow

Return the flow between two vertices.

getFlowTo(V) - Method in class fr.inria.opengve.bridge.algorithms.directed.ExtractFlow

Give the flow from source to destination.

getHead() - Method in interface fr.inria.opengve.bridge.interfaces.Arc

Give the head of this arc.

getIncomingFlow(V) - Method in interface fr.inria.opengve.bridge.interfaces.Flow

Return the quantity of flow incoming to vertex v.

getIncomingFlow(V) - Method in interface fr.inria.opengve.bridge.interfaces.MultiFlow

Return the quantity of flow incoming to vertex v.

getInitialSeed() - Method in class fr.inria.opengve.bridge.algorithms.common.RandomWalk

Return the seed used to initialize this random walk.

getLastVertex() - Method in interface fr.inria.opengve.bridge.interfaces.Path

Return the last vertex of an oriented Path.

getLinkSet() - Method in class fr.inria.opengve.bridge.algorithms.directed.EdmondsKarp

Compute and returns the subSet of links that are cutted by the subdivision of the vertices set in source set and destination set.

getMessageArgs() - Method in class fr.inria.opengve.bridge.algorithms.StepAlgo.StepAlgoMessage

Return the args associated with this message.

getMST() - Method in class fr.inria.opengve.bridge.algorithms.undirected.Kruskal

Return a minimum spanning tree.

getMST() - Method in class fr.inria.opengve.bridge.algorithms.undirected.PrimST

Return the computed minimum spanning tree.

getMSTWeight() - Method in class fr.inria.opengve.bridge.algorithms.undirected.PrimST

Return the weight of the computed MST.

getNextPath(V, V) - Method in class fr.inria.opengve.bridge.algorithms.common.RandomWalk

Give the next random walk.

getOpposite(V) - Method in interface fr.inria.opengve.bridge.interfaces.Link

Returns the opposite vertex of a specified object in this link.

getOutgoingFlow(V) - Method in interface fr.inria.opengve.bridge.interfaces.Flow

Return the quantity of flow outgoing from vertex v.

getOutgoingFlow(V) - Method in interface fr.inria.opengve.bridge.interfaces.MultiFlow

Return the quantity of flow outgoing from vertex v.

getShortestPath(V, V) - Method in class fr.inria.opengve.bridge.algorithms.common.shortestPath.FloydWarshall

Give a shortest path between two vertices.

getShortestPath(int) - Method in class fr.inria.opengve.bridge.algorithms.common.shortestPath.KShortestPaths

Return the k-th path computed.

getShortestPathTo(V) - Method in class fr.inria.opengve.bridge.algorithms.common.shortestPath.Dijkstra

Returns the path from source to vertex v.

getShortestPathTo(V) - Method in class fr.inria.opengve.bridge.algorithms.common.shortestPath.ShortestPathWithSingleOrigin

Returns a shortest path form source to vertex v.

getSolution() - Method in class fr.inria.opengve.bridge.algorithms.common.FindElementaryCycles

Give the set of cycles in graph g.

getSource() - Method in interface fr.inria.opengve.bridge.interfaces.Flow

Give the source of this flow.

getSourceSet() - Method in class fr.inria.opengve.bridge.algorithms.directed.EdmondsKarp

Returns the subSet of vertices that are chunked with the source

getStartNode() - Method in class fr.inria.opengve.bridge.algorithms.common.shortestPath.Dijkstra

Returns the current starting node.

getStepMode() - Method in class fr.inria.opengve.bridge.algorithms.StepAlgo

Say if the algorithms stop in StepAlgo.pause().

getString(Object, String) - Method in interface fr.inria.opengve.bridge.interfaces.Map

Returns the String value associated with a principal key, a given name and the default context.

getString(Object, String, Object) - Method in interface fr.inria.opengve.bridge.interfaces.Map

Returns the String value associated with a principal key, a given name and context.

getSuperSet() - Method in interface fr.inria.opengve.bridge.interfaces.HierarchicalSet

If this set has been created as a subset of another set s with HierarchicalSet.newSubSet() or HierarchicalSet.newSubSet(Iterator), then returns s.

getSupportingGraph() - Method in interface fr.inria.opengve.bridge.interfaces.MultiFlow

Give the supporting graph associated with this flow.

getTail() - Method in interface fr.inria.opengve.bridge.interfaces.Arc

Give the tail of this arc.

getType() - Method in class fr.inria.opengve.bridge.algorithms.StepAlgo.StepAlgoMessage

Return the type of this message.

getUnderlyingGraph() - Method in interface fr.inria.opengve.bridge.interfaces.Flow

Give the underlying graph associated with this flow.

getValue(Object, String) - Method in interface fr.inria.opengve.bridge.interfaces.Map

Returns the AbstractScalar value associated with a principal key, a given name and the default context.

getValue(Object, String, Object) - Method in interface fr.inria.opengve.bridge.interfaces.Map

Returns the AbstractScalar value associated with a principal key, a given name and context.

getVertexMinCut() - Method in class fr.inria.opengve.bridge.algorithms.undirected.minCut.NagamochiMinCut

Give the minimum cut of the graph as a cuple of vertex set.

Graph<V,E extends Link<V>> - Interface in fr.inria.opengve.bridge.interfaces

A graph is a pair formed by a set of vertices and a birelation of the vertices, called the edge set.

GraphUtility - Class in fr.inria.opengve.bridge.algorithms

This static class permit to verify various graph properties.

GraphUtility.Propriety - Enum in fr.inria.opengve.bridge.algorithms

All possible properties that can be tested.

H

hashCodeArray() - Method in interface fr.inria.opengve.bridge.interfaces.Graph

Returns an array of integers containing the hash codes of all of the edges in this graph.

haveLoopLinks(Graph<V, L>) - Static method in class fr.inria.opengve.bridge.algorithms.GraphUtility

Test if a given graph contains a loop.

HierarchicalSet<E> - Interface in fr.inria.opengve.bridge.interfaces

This interface defines the functionalities of the sets returned by methods of the interface Graph.

I

inducedSubGraph(Set<V>) - Method in interface fr.inria.opengve.bridge.interfaces.Graph

Returns the subgraph induced by the specified subset of vertices.

inEdges(V) - Method in interface fr.inria.opengve.bridge.interfaces.Graph

Return all the edges leading to v in this graph.

infiniteDistance - Variable in class fr.inria.opengve.bridge.algorithms.common.shortestPath.ShortestPathWithSingleOrigin

The infinite distance value.

Initialize(AbstractScalar) - Method in class fr.inria.opengve.bridge.algorithms.common.shortestPath.ShortestPathWithSingleOrigin

This methods initialise data structure.

inNeighborhood(V) - Method in interface fr.inria.opengve.bridge.interfaces.Graph

Returns the specified vertex's in neighborhood in this graph.

inOutEdges(V) - Method in interface fr.inria.opengve.bridge.interfaces.Graph

Return all the edges connected to this vertex in this graph.

inverse() - Method in interface fr.inria.opengve.bridge.interfaces.Graph

Returns the inverse of this graph.

isConnectedGraph(Graph<V, L>, boolean) - Static method in class fr.inria.opengve.bridge.algorithms.GraphUtility

Test the connectivity of a given graph.

isDirected() - Method in interface fr.inria.opengve.bridge.interfaces.Cycle

Tell if this cycle is directed or not.

isDirected() - Method in interface fr.inria.opengve.bridge.interfaces.Path

Say if this path is oriented.

isEnd(V) - Method in interface fr.inria.opengve.bridge.interfaces.Path

Determine if a vertex is an end of this path.

isEnded() - Method in class fr.inria.opengve.bridge.algorithms.StepAlgo

As the algorithm is run as a thread, we want to know when it ends.

isLoop() - Method in interface fr.inria.opengve.bridge.interfaces.Link

Answers whether the both vertex of this link are identical.

isMultiGraph(Graph<V, L>) - Static method in class fr.inria.opengve.bridge.algorithms.GraphUtility

Test if a given graph is a multigraph.

isSubSetOf(HierarchicalSet<?>) - Method in interface fr.inria.opengve.bridge.interfaces.HierarchicalSet

Says if the object is a subset of a specified set.

K

keysIterator() - Method in interface fr.inria.opengve.bridge.interfaces.Map

Give an iterator on the principals keys store in this map.

Kruskal<V,E extends Edge<V>,G extends Graph<V,E>> - Class in fr.inria.opengve.bridge.algorithms.undirected

This class implement the Kruskal algorithms to compute minimum spanning tree, it work only on non directed graph.

Kruskal(G, Map) - Constructor for class fr.inria.opengve.bridge.algorithms.undirected.Kruskal

Constructor.

Kruskal(G, Map, boolean) - Constructor for class fr.inria.opengve.bridge.algorithms.undirected.Kruskal

Constructor.

KShortestPaths<V,E extends Link<V>,G extends Graph<V,E>> - Class in fr.inria.opengve.bridge.algorithms.common.shortestPath

This class solve the problem of k-shortest path (not disjoint).

KShortestPaths(G, Map) - Constructor for class fr.inria.opengve.bridge.algorithms.common.shortestPath.KShortestPaths

Constructor of KShortestPaths.

KShortestPaths(G, Map, boolean) - Constructor for class fr.inria.opengve.bridge.algorithms.common.shortestPath.KShortestPaths

This constructor permit to specify the stepMode of the algorithm.

L

leadsTo(V) - Method in interface fr.inria.opengve.bridge.interfaces.Link

Answers whether a specified object is the second vertex of this link (optional operation).

leavesFrom(V) - Method in interface fr.inria.opengve.bridge.interfaces.Link

Answers whether a specified object is the first vertex of this link (optional operation).

length() - Method in interface fr.inria.opengve.bridge.interfaces.Cycle

Give the length of this cycle (in terms of edges).

length() - Method in interface fr.inria.opengve.bridge.interfaces.Path

Give the length (number of edges) of this path.

Link<V> - Interface in fr.inria.opengve.bridge.interfaces

The root interface in the hierarchy of interfaces implemented by elements of the set returned by the linkSet method of some graph (more precisely, of an implementation of the Graph interface).

log() - Method in class fr.inria.opengve.bridge.abstractClasses.AbstractScalar

Set the value this AbstractScalar to the log of this AbstractScalar.

log10() - Method in class fr.inria.opengve.bridge.abstractClasses.AbstractScalar

Set the value this AbstractScalar to the log10 of this AbstractScalar.

M

Map - Interface in fr.inria.opengve.bridge.interfaces

The Map interface define a new data structure interface.

Max(A, A) - Static method in class fr.inria.opengve.bridge.abstractClasses.AbstractScalar

Compare two AbstractScalar and return the greatest.

Min(A, A) - Static method in class fr.inria.opengve.bridge.abstractClasses.AbstractScalar

Compare two AbstractScalar and return the smallest.

MultiFlow<V,A extends Arc<V>> - Interface in fr.inria.opengve.bridge.interfaces

This interface is used to manage multi-flow.

multiply(AbstractScalar) - Method in class fr.inria.opengve.bridge.abstractClasses.AbstractScalar

Multiply this object by an AbstractScalar.

N

NagamochiMinCut<V,E extends Edge<V>,G extends Graph<V,E>> - Class in fr.inria.opengve.bridge.algorithms.undirected.minCut

Compute the minimum cut of a graph.

NagamochiMinCut(G, boolean) - Constructor for class fr.inria.opengve.bridge.algorithms.undirected.minCut.NagamochiMinCut

Initialize the algorithm with step mode set to a given value

NagamochiMinCut(G) - Constructor for class fr.inria.opengve.bridge.algorithms.undirected.minCut.NagamochiMinCut

Initialize the algorithm.

namesIterator(Object) - Method in interface fr.inria.opengve.bridge.interfaces.Map

Give an Iterator on all the name of values associated with a given principal key and the default context.

namesIterator(Object, Object) - Method in interface fr.inria.opengve.bridge.interfaces.Map

Give an Iterator on all the name of values associated with a given principal key and context.

negate() - Method in class fr.inria.opengve.bridge.abstractClasses.AbstractScalar

Change the value of this AbstractScalar to the opposite.

neighborhood(V) - Method in interface fr.inria.opengve.bridge.interfaces.Graph

The vertices connected to the specified vertex.

newSubSet() - Method in interface fr.inria.opengve.bridge.interfaces.HierarchicalSet

Returns a new empty set which is a subset of this set.

newSubSet(Iterator<? extends E>) - Method in interface fr.inria.opengve.bridge.interfaces.HierarchicalSet

Returns a new set which is a subset of this set.

nextStep() - Method in class fr.inria.opengve.bridge.algorithms.StepAlgo

When calling nextStep, the algorithm is unpaused.

notifyGraphDisplayRequest(Graph<V, E>) - Method in class fr.inria.opengve.bridge.algorithms.StepAlgo

Send a graphic request.

notifyGraphDisplayRequest(Graph<V, E>, String) - Method in class fr.inria.opengve.bridge.algorithms.StepAlgo

Send a graphic request.

notifyLabelEdgesRequest(Graph<V, E>, Map, Object, String) - Method in class fr.inria.opengve.bridge.algorithms.StepAlgo

Request a edges label display for a graph.

notifyLabelVerticesRequest(Graph<V, E>, Map, Object, String) - Method in class fr.inria.opengve.bridge.algorithms.StepAlgo

Request a vertices label display for a graph.

numberOfComputedPaths - Variable in class fr.inria.opengve.bridge.algorithms.common.shortestPath.KShortestPaths

The current number of computed paths.

numberOfComputedPaths() - Method in class fr.inria.opengve.bridge.algorithms.common.shortestPath.KShortestPaths

Return the number of computed paths.

O

outEdges(V) - Method in interface fr.inria.opengve.bridge.interfaces.Graph

Return all the edges leaving v in this graph.

outNeighborhood(V) - Method in interface fr.inria.opengve.bridge.interfaces.Graph

Returns the specified vertex's out neighborhood in this graph.

P

Path<V,E extends Link<V>> - Interface in fr.inria.opengve.bridge.interfaces

A path in a Graph is a sequence of vertices such that from each of its vertices there is an Link to the successor vertex.

pause() - Method in class fr.inria.opengve.bridge.algorithms.StepAlgo

Give a method to put a pause in your algorithm.

pow(AbstractScalar) - Method in class fr.inria.opengve.bridge.abstractClasses.AbstractScalar

Set the value of this AbstractScalar to this^c.

PrimST<V,E extends Edge<V>> - Class in fr.inria.opengve.bridge.algorithms.undirected

This class computes the Minimum Spanning Tree of a graph G with the Prim's algorithm.

PrimST(Graph<V, E>, Map) - Constructor for class fr.inria.opengve.bridge.algorithms.undirected.PrimST

PrimST(Graph<V, E>, Map, boolean) - Constructor for class fr.inria.opengve.bridge.algorithms.undirected.PrimST

putAll(Map<?, ?>, String) - Method in interface fr.inria.opengve.bridge.interfaces.Map

Put all pairs of values present in a Map in this Map with a given name.

putAll(Map<?, ?>, String, Object) - Method in interface fr.inria.opengve.bridge.interfaces.Map

Put all pairs of values present in a Map in this Map with a given name and context.

putString(Object, String, String) - Method in interface fr.inria.opengve.bridge.interfaces.Map

Associate a value (String) with a principal key, a name and the default context.

putString(Object, String, Object, String) - Method in interface fr.inria.opengve.bridge.interfaces.Map

Associate a value (String) with a principal key, a given name and a context.

putValue(Object, String, AbstractScalar) - Method in interface fr.inria.opengve.bridge.interfaces.Map

Associate a value (AbstractScalar) with a principal key, a name and the default context.

putValue(Object, String, Object, AbstractScalar) - Method in interface fr.inria.opengve.bridge.interfaces.Map

Associate a value (AbstractScalar) with a principal key, a name and a context.

R

RandomWalk<V,E extends Link<V>,G extends Graph<V,E>> - Class in fr.inria.opengve.bridge.algorithms.common

RandomWalk(G) - Constructor for class fr.inria.opengve.bridge.algorithms.common.RandomWalk

Initialize random walk generator for a given graph and from a given vertex.

RandomWalk(G, long) - Constructor for class fr.inria.opengve.bridge.algorithms.common.RandomWalk

Initialize random walk generator for a given graph and from a given vertex.

rechabilityLinks(V, Graph<V, L>) - Static method in class fr.inria.opengve.bridge.algorithms.GraphUtility

Give the set of all reachable links from a given starting vertex.

rechabilityVertices(V, Graph<V, L>, boolean) - Static method in class fr.inria.opengve.bridge.algorithms.GraphUtility

Give the set of vertices reachable from a given one.

remove(Object, String) - Method in interface fr.inria.opengve.bridge.interfaces.Map

Remove the entry corresponding to a given principal key, a given name and the default context.

remove(Object, String, Object) - Method in interface fr.inria.opengve.bridge.interfaces.Map

Remove the entry corresponding to a given principal key, a given name and a given context.

remove(V) - Method in interface fr.inria.opengve.bridge.interfaces.Path

Remove one vertex from a this path.

remove(E) - Method in interface fr.inria.opengve.bridge.interfaces.Path

Remove one Link from this Path.

removeAll(Object, Object) - Method in interface fr.inria.opengve.bridge.interfaces.Map

Remove all values associated with a given principal key and context.

removeAll(Object) - Method in interface fr.inria.opengve.bridge.interfaces.Map

Remove all values associated with a given principal key.

removeEdge(Object, Object) - Method in interface fr.inria.opengve.bridge.interfaces.Graph

Remove all edges between two vertices.

removeEdge(Object) - Method in interface fr.inria.opengve.bridge.interfaces.Graph

Remove operation of the edge

removeVertex(V) - Method in interface fr.inria.opengve.bridge.interfaces.Graph

Remove an vertex to the graph.

residualCapacityName - Static variable in class fr.inria.opengve.bridge.algorithms.directed.EdmondsKarp

The name used during the execution of algorithms for storing residual capacity.

result - Variable in class fr.inria.opengve.bridge.algorithms.common.shortestPath.ShortestPathWithSingleOrigin

The map where result are stored.

run() - Method in class fr.inria.opengve.bridge.algorithms.common.FindElementaryCycles

Compute all the elementary cycles of graph.

run() - Method in class fr.inria.opengve.bridge.algorithms.common.FindElementaryCyclesFrom

run() - Method in class fr.inria.opengve.bridge.algorithms.common.shortestPath.BellmanFord

run() - Method in class fr.inria.opengve.bridge.algorithms.common.shortestPath.Dijkstra

Computes the shortest distances and paths from vertex u.

run() - Method in class fr.inria.opengve.bridge.algorithms.common.shortestPath.DijkstraAdvanced

This method must not be call, use instead ShortestPathWithSingleOrigin.valuateFromSource(Object).

run() - Method in class fr.inria.opengve.bridge.algorithms.common.shortestPath.KShortestPaths

Runs the computation of k shortests paths between s and t.

run() - Method in class fr.inria.opengve.bridge.algorithms.directed.EdmondsKarp

run() - Method in class fr.inria.opengve.bridge.algorithms.StepAlgo

Run the algorithm.

run() - Method in class fr.inria.opengve.bridge.algorithms.undirected.Kruskal

Compute the minimum spanning tree of graph.

run() - Method in class fr.inria.opengve.bridge.algorithms.undirected.minCut.NagamochiMinCut

Compute the minimum cut of the graph.

run() - Method in class fr.inria.opengve.bridge.algorithms.undirected.PrimST

Compute the MST.

S

setCapacityContext(Object) - Method in class fr.inria.opengve.bridge.algorithms.common.AugmentingPath

Set the context used to load capacity in the map.

setCapacityContext(Object) - Method in class fr.inria.opengve.bridge.algorithms.directed.EdmondsKarp

Set the context used to load capacity of edges in the map.

setCapacityMap(Map) - Method in class fr.inria.opengve.bridge.algorithms.common.AugmentingPath

Set the map used to load capacity.

setCapacityName(String) - Method in class fr.inria.opengve.bridge.algorithms.common.AugmentingPath

Set the name used to load capacity in the map.

setCapacityName(String) - Method in class fr.inria.opengve.bridge.algorithms.directed.EdmondsKarp

Set the name used to load capacity of edges in the map.

setCostContext(Object) - Method in class fr.inria.opengve.bridge.algorithms.common.AugmentingPath

Set the context used to load cost in the map.

setCostMap(Map) - Method in class fr.inria.opengve.bridge.algorithms.common.AugmentingPath

Set the map used to load cost.

setCostName(String) - Method in class fr.inria.opengve.bridge.algorithms.common.AugmentingPath

Set the name used to load cost in the map.

setDestination(V) - Method in class fr.inria.opengve.bridge.algorithms.directed.EdmondsKarp

Set the destination of the computed flow.

setDistanceContext(Object) - Method in class fr.inria.opengve.bridge.algorithms.common.shortestPath.FloydWarshall

Set context used to load distance of edges.

setDistanceContext(Object) - Method in class fr.inria.opengve.bridge.algorithms.common.shortestPath.KShortestPaths

Set the context used to load distance of edges in the map.

setDistanceContext(Object) - Method in class fr.inria.opengve.bridge.algorithms.common.shortestPath.ShortestPathWithSingleOrigin

Set the context used to load distance of edges.

setDistanceContext(Object) - Method in class fr.inria.opengve.bridge.algorithms.undirected.minCut.StoerWagnerMinCut

Set the context used to read edge's distance in the map.

setDistanceMap(Map) - Method in class fr.inria.opengve.bridge.algorithms.common.shortestPath.FloydWarshall

Set the map used to load distance of edges.

setDistanceMap(Map) - Method in class fr.inria.opengve.bridge.algorithms.common.shortestPath.ShortestPathWithSingleOrigin

Set the map used to load distance of edges.

setDistanceMap(Map) - Method in class fr.inria.opengve.bridge.algorithms.undirected.minCut.StoerWagnerMinCut

Set the map used to read edge's distance.

setDistanceName(String) - Method in class fr.inria.opengve.bridge.algorithms.common.shortestPath.FloydWarshall

Set the name used to load distance of edges in the map.

setDistanceName(String) - Method in class fr.inria.opengve.bridge.algorithms.common.shortestPath.KShortestPaths

Set the name used to load distance of edges in the map.

setDistanceName(String) - Method in class fr.inria.opengve.bridge.algorithms.common.shortestPath.ShortestPathWithSingleOrigin

Set the name used to load distance of edges in the map.

setDistanceName(String) - Method in class fr.inria.opengve.bridge.algorithms.undirected.minCut.StoerWagnerMinCut

Set the name used to read edge's distance in the map.

setEdgeCostContext(Object) - Method in class fr.inria.opengve.bridge.algorithms.common.FindElementaryCycles

Change the context used to access cost of edges in the Map cost.

setEdgeCostContext(Object) - Method in class fr.inria.opengve.bridge.algorithms.common.FindElementaryCyclesFrom

Change the context used to access cost of edge in the Map cost.

setEdgeCostName(String) - Method in class fr.inria.opengve.bridge.algorithms.common.FindElementaryCycles

Change the name used to access cost of edge in the Map cost.

setEdgeCostName(String) - Method in class fr.inria.opengve.bridge.algorithms.common.FindElementaryCyclesFrom

Change the name used to access cost of edge in the Map cost.

setEdgesValueContext(Object) - Method in class fr.inria.opengve.bridge.algorithms.undirected.minCut.NagamochiMinCut

Set the context used to load edges values in the map.

setEdgesValueMap(Map) - Method in class fr.inria.opengve.bridge.algorithms.undirected.minCut.NagamochiMinCut

Set the map used to load edges values.

setEdgesValueName(String) - Method in class fr.inria.opengve.bridge.algorithms.undirected.minCut.NagamochiMinCut

Set the name used to load edges values in the map.

setEndsOfPath(V, V) - Method in class fr.inria.opengve.bridge.algorithms.common.shortestPath.KShortestPaths

Set the ends of computed paths.

setFlow(V, V, AbstractScalar) - Method in interface fr.inria.opengve.bridge.interfaces.Flow

Set source, destination and value of this flow.

setFlow(A, AbstractScalar) - Method in interface fr.inria.opengve.bridge.interfaces.Flow

Set the quantity of flow associated to an edge.

setGraph(Graph<V, E>) - Method in class fr.inria.opengve.bridge.algorithms.undirected.minCut.StoerWagnerMinCut

Set the graph on which is computed the minimal cut.

setInfiniteDistance(AbstractScalar) - Method in class fr.inria.opengve.bridge.algorithms.common.shortestPath.FloydWarshall

Set the value used as infinite distance.

setInfiniteDistance(AbstractScalar) - Method in class fr.inria.opengve.bridge.algorithms.common.shortestPath.KShortestPaths

Set the distance used as infinite.

setInfiniteDistance(AbstractScalar) - Method in class fr.inria.opengve.bridge.algorithms.common.shortestPath.ShortestPathWithSingleOrigin

Set the value used as infinite distance.

setInfiniteValue(AbstractScalar) - Method in class fr.inria.opengve.bridge.algorithms.undirected.PrimST

Set the value used as infinity.

setInfinity(AbstractScalar) - Method in class fr.inria.opengve.bridge.algorithms.directed.ExtractFlow

Set the AbstractScalar used to represent Infinity.

setInitialVertex(V) - Method in class fr.inria.opengve.bridge.algorithms.undirected.PrimST

This method can be used to set the root of the resulting MST.

setLengthContext(Object) - Method in class fr.inria.opengve.bridge.algorithms.undirected.Kruskal

Set the context used to load edge length in the map.

setLengthContext(Object) - Method in class fr.inria.opengve.bridge.algorithms.undirected.PrimST

Set the context used to load edge length in the map.

setLengthName(String) - Method in class fr.inria.opengve.bridge.algorithms.undirected.Kruskal

Set the name used to load value of edge length in the map.

setLengthName(String) - Method in class fr.inria.opengve.bridge.algorithms.undirected.PrimST

Set the name used to load edge length in the map.

setNumberOfComputedPath(int) - Method in class fr.inria.opengve.bridge.algorithms.common.shortestPath.KShortestPaths

Set the number of paths that must be computed.

setPauseMode(boolean) - Method in class fr.inria.opengve.bridge.algorithms.StepAlgo

Change the behavior of StepAlgo.pause() methods.

setSource(V) - Method in class fr.inria.opengve.bridge.algorithms.directed.EdmondsKarp

Set the source of the computed flow.

setTime(int) - Method in class fr.inria.opengve.bridge.algorithms.StepAlgo

Set wait time in milliseconds

ShortestPathWithSingleOrigin<V,E extends Link<V>,G extends Graph<V,E>> - Class in fr.inria.opengve.bridge.algorithms.common.shortestPath

This class define common datas and methods between DijkstraAdvanced and BellmanFord.

ShortestPathWithSingleOrigin(G, boolean) - Constructor for class fr.inria.opengve.bridge.algorithms.common.shortestPath.ShortestPathWithSingleOrigin

Initialize data structures.

sourceIterator() - Method in interface fr.inria.opengve.bridge.interfaces.MultiFlow

Give an iterator on the source vertex of this multi-flow.

sqrt() - Method in class fr.inria.opengve.bridge.abstractClasses.AbstractScalar

Set this AbstractScalar to sqare root of this.

start() - Method in class fr.inria.opengve.bridge.algorithms.StepAlgo

Launch the algorithm

start_ - Variable in class fr.inria.opengve.bridge.algorithms.common.shortestPath.ShortestPathWithSingleOrigin

The vertex from which shortest paths are computed.

StepAlgo<V,E extends Link<V>> - Class in fr.inria.opengve.bridge.algorithms

StepAlgo is a class wich provides a way of running an algorithm step by step.

StepAlgo(boolean) - Constructor for class fr.inria.opengve.bridge.algorithms.StepAlgo

Constructor that permit to specify the step by step mode.

StepAlgo.StepAlgoMessage - Class in fr.inria.opengve.bridge.algorithms

This class is used by StepAlgo to notify this obsevers.

StepAlgo.StepAlgoMessageType - Enum in fr.inria.opengve.bridge.algorithms

Enum of the type of message.

StoerWagnerMinCut<V,E extends Edge<V>> - Class in fr.inria.opengve.bridge.algorithms.undirected.minCut

This algorithm is based on: A simple min-cut algorithm Source Journal of the ACM (JACM) archive Volume 44 , Issue 4 (July 1997) table of contents Pages: 585 - 591 Year of Publication: 1997 ISSN:0004-5411 Authors Mechthild Stoer Televerkets Forskningsinstitutt, Kjeller, Norway Frank Wagner Freie Univ.

StoerWagnerMinCut() - Constructor for class fr.inria.opengve.bridge.algorithms.undirected.minCut.StoerWagnerMinCut

Initialize the algorithm.

subtract(AbstractScalar) - Method in class fr.inria.opengve.bridge.abstractClasses.AbstractScalar

Subtract an AbstractScalar to this object.

T

toArray() - Method in interface fr.inria.opengve.bridge.interfaces.Link

Returns the two vertices of the link in a 2-element array where one vertex is placed in the first position (index 0) and the other vertex occupies the second position (index 1).

toArray(T[]) - Method in interface fr.inria.opengve.bridge.interfaces.Link

Returns an array containing the two vertex of the link; the runtime type of the returned array is that of the specified array.

toString() - Method in class fr.inria.opengve.bridge.abstractClasses.AbstractScalar

toString() - Method in interface fr.inria.opengve.bridge.interfaces.Graph

Converts this Grqph in string to be printed.

U

updateVerticesDistance(V, V, E) - Method in class fr.inria.opengve.bridge.algorithms.common.shortestPath.ShortestPathWithSingleOrigin

Update the distance of a given vertice v2 with the distance of vertex v1 plus the distance of the Link edge if and only if this value is lesser that the initial one.

V

valuateFromSource(V) - Method in class fr.inria.opengve.bridge.algorithms.common.shortestPath.Dijkstra

Computes the shortest distances and paths from node u.

valuateFromSource(V) - Method in class fr.inria.opengve.bridge.algorithms.common.shortestPath.ShortestPathWithSingleOrigin

Computes the shortest distances and paths from node u.

valueOf(String) - Static method in enum fr.inria.opengve.bridge.algorithms.GraphUtility.Propriety

Returns the enum constant of this type with the specified name.

valueOf(String) - Static method in enum fr.inria.opengve.bridge.algorithms.StepAlgo.StepAlgoMessageType

Returns the enum constant of this type with the specified name.

values() - Static method in enum fr.inria.opengve.bridge.algorithms.GraphUtility.Propriety

Returns an array containing the constants of this enum type, in the order they're declared.

values() - Static method in enum fr.inria.opengve.bridge.algorithms.StepAlgo.StepAlgoMessageType

Returns an array containing the constants of this enum type, in the order they're declared.

verify(Graph<V, L>) - Method in enum fr.inria.opengve.bridge.algorithms.GraphUtility.Propriety

Verify that a given graph verify this property.

verify() - Method in interface fr.inria.opengve.bridge.interfaces.Flow

Verify the coherence of the flow.

verify() - Method in interface fr.inria.opengve.bridge.interfaces.MultiFlow

Verify the coherence of the flow.

VERTEX_DISTANCE - Static variable in class fr.inria.opengve.bridge.algorithms.common.shortestPath.ShortestPathWithSingleOrigin

The string which identify the value to consider as the distance on vertex.

VERTEX_WEIGHT_NAME - Static variable in class fr.inria.opengve.bridge.algorithms.undirected.PrimST

This is the name used to store weight of vertex in demoMode only.

vertexIterator() - Method in interface fr.inria.opengve.bridge.interfaces.Cycle

Give an Iterator on the vertices of this cycle.

vertexIterator(V) - Method in interface fr.inria.opengve.bridge.interfaces.Cycle

Give an Iterator on the vertices of this cycle.

vertexIterator(V) - Method in interface fr.inria.opengve.bridge.interfaces.Path

Give an iterator on the vertex of the path.

vertexSet() - Method in interface fr.inria.opengve.bridge.interfaces.Graph

Returns a set view of the vertices of this graph.

Z

zero() - Method in class fr.inria.opengve.bridge.abstractClasses.AbstractScalar

Return an AbstractScalar of the same type of this AbstractScalar with a value of zero.

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