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

A

addEdge(E) - Method in class org.apache.commons.graph.model.BaseMutableGraph

Adds a feature to the Edge attribute of the MutableGraph object

addEdge(E, V, V) - Method in interface org.apache.commons.graph.MutableDirectedGraph

Adds a feature to the Edge attribute of the MutableDirectedGraph object.

addEdge(E) - Method in interface org.apache.commons.graph.MutableGraph

Adds a feature to the Edge attribute of the MutableGraph object

addEdgeInHead(WE) - Method in class org.apache.commons.graph.model.InMemoryPath

addEdgeInTail(WE) - Method in class org.apache.commons.graph.model.InMemoryPath

addVertex(V) - Method in class org.apache.commons.graph.model.BaseMutableGraph

Adds a feature to the Vertex attribute of the MutableGraph object.

addVertex(V) - Method in interface org.apache.commons.graph.MutableDirectedGraph

Adds a feature to the Vertex attribute of the MutableDirectedGraph object.

addVertex(V) - Method in interface org.apache.commons.graph.MutableGraph

Adds a feature to the Vertex attribute of the MutableGraph object.

addVertexInHead(V) - Method in class org.apache.commons.graph.model.InMemoryPath

addVertexInTail(V) - Method in class org.apache.commons.graph.model.InMemoryPath

B

BaseGraph<V extends Vertex,E extends Edge<V>> - Class in org.apache.commons.graph.model

Basic abstract in-memory based of a simple read-only Graph implementation.

BaseGraph() - Constructor for class org.apache.commons.graph.model.BaseGraph

BaseGraphVisitHandler<V extends Vertex,E extends Edge<V>> - Class in org.apache.commons.graph.visit

Base NOOP GraphVisitHandler implementation.

BaseGraphVisitHandler() - Constructor for class org.apache.commons.graph.visit.BaseGraphVisitHandler

BaseMutableGraph<V extends Vertex,E extends Edge<V>> - Class in org.apache.commons.graph.model

Basic abstract in-memory based of a simple mutable Graph implementation.

BaseMutableGraph() - Constructor for class org.apache.commons.graph.model.BaseMutableGraph

Boruvka - Class in org.apache.commons.graph.spanning

Boruvka's algorithm is an algorithm for finding a minimum spanning tree in a graph for which all edge weights are distinct.

Boruvka() - Constructor for class org.apache.commons.graph.spanning.Boruvka

breadthFirstSearch(Graph<V, E>, V) - Method in class org.apache.commons.graph.visit.Visit

Breadth-first search algorithm implementation.

breadthFirstSearch(Graph<V, E>, V, GraphVisitHandler<V, E>) - Method in class org.apache.commons.graph.visit.Visit

Breadth-first search algorithm implementation.

D

decorateAddEdge(E) - Method in class org.apache.commons.graph.model.BaseMutableGraph

decorateAddEdge(E) - Method in class org.apache.commons.graph.model.DirectedMutableGraph

decorateAddVertex(V) - Method in class org.apache.commons.graph.model.BaseMutableGraph

decorateAddVertex(V) - Method in class org.apache.commons.graph.model.DirectedMutableGraph

decorateRemoveEdge(E) - Method in class org.apache.commons.graph.model.BaseMutableGraph

decorateRemoveEdge(E) - Method in class org.apache.commons.graph.model.DirectedMutableGraph

decorateRemoveVertex(V) - Method in class org.apache.commons.graph.model.BaseMutableGraph

decorateRemoveVertex(V) - Method in class org.apache.commons.graph.model.DirectedMutableGraph

depthFirstSearch(Graph<V, E>, V) - Method in class org.apache.commons.graph.visit.Visit

Depth-first search algorithm implementation.

depthFirstSearch(Graph<V, E>, V, GraphVisitHandler<V, E>) - Method in class org.apache.commons.graph.visit.Visit

Depth-first search algorithm implementation.

Dijkstra - Class in org.apache.commons.graph.shortestpath

DirectedGraph<V extends Vertex,E extends Edge<V>> - Interface in org.apache.commons.graph

A DirectedGraph or digraph is an ordered pair D = ( V, E ) with V a set whose elements are called vertices or nodes, and E a set of ordered pairs of vertices, called arcs, directed edges, or arrows.

DirectedMutableGraph<V extends Vertex,E extends Edge<V>> - Class in org.apache.commons.graph.model

A memory-based implementation of a mutable directed Graph.

DirectedMutableGraph() - Constructor for class org.apache.commons.graph.model.DirectedMutableGraph

DirectedMutableWeightedGraph<V extends Vertex,WE extends WeightedEdge<V>> - Class in org.apache.commons.graph.model

A memory-based implementation of a mutable, directed weighted Graph.

DirectedMutableWeightedGraph() - Constructor for class org.apache.commons.graph.model.DirectedMutableWeightedGraph

discoverEdge(E) - Method in class org.apache.commons.graph.visit.BaseGraphVisitHandler

Description of the Method

discoverEdge(E) - Method in interface org.apache.commons.graph.visit.GraphVisitHandler

Description of the Method

discoverGraph(Graph<V, E>) - Method in class org.apache.commons.graph.visit.BaseGraphVisitHandler

Description of the Method

discoverGraph(Graph<V, E>) - Method in interface org.apache.commons.graph.visit.GraphVisitHandler

Description of the Method

discoverVertex(V) - Method in class org.apache.commons.graph.visit.BaseGraphVisitHandler

Description of the Method

discoverVertex(V) - Method in interface org.apache.commons.graph.visit.GraphVisitHandler

Description of the Method

E

Edge<V extends Vertex> - Interface in org.apache.commons.graph

An Edge is the link that connect a pair of Vertex.

equals(Object) - Method in class org.apache.commons.graph.model.InMemoryPath

F

findShortestPath(WeightedGraph<V, WE>, V, V) - Static method in class org.apache.commons.graph.shortestpath.Dijkstra

Applies the classical Dijkstra algorithm to find the shortest path from the source to the target, if exists.

finishEdge(E) - Method in class org.apache.commons.graph.visit.BaseGraphVisitHandler

Description of the Method

finishEdge(E) - Method in interface org.apache.commons.graph.visit.GraphVisitHandler

Description of the Method

finishGraph(Graph<V, E>) - Method in class org.apache.commons.graph.visit.BaseGraphVisitHandler

Description of the Method

finishGraph(Graph<V, E>) - Method in interface org.apache.commons.graph.visit.GraphVisitHandler

Description of the Method

finishVertex(V) - Method in class org.apache.commons.graph.visit.BaseGraphVisitHandler

Description of the Method

finishVertex(V) - Method in interface org.apache.commons.graph.visit.GraphVisitHandler

Description of the Method

G

getAdjacencyList() - Method in class org.apache.commons.graph.model.BaseGraph

Returns the adjacency list where stored vertex/edges.

getAllEdges() - Method in class org.apache.commons.graph.model.BaseGraph

Returns the set with all Graph edges.

getEdges() - Method in interface org.apache.commons.graph.Graph

Returns the total set of Edges in the graph.

getEdges(V) - Method in interface org.apache.commons.graph.Graph

Returns all edges which touch this vertex, where the input vertex is in the edge head.

getEdges() - Method in class org.apache.commons.graph.model.BaseGraph

Returns the total set of Edges in the graph.

getEdges(V) - Method in class org.apache.commons.graph.model.BaseGraph

Returns all edges which touch this vertex, where the input vertex is in the edge head.

getEdges() - Method in class org.apache.commons.graph.model.InMemoryPath

getEdges() - This returns a list of Edges which comprise the path.

getEdges() - Method in interface org.apache.commons.graph.Path

getEdges() - This returns a list of Edges which comprise the path.

getHead() - Method in interface org.apache.commons.graph.Edge

Return the head of this edge.

getInbound(V) - Method in interface org.apache.commons.graph.DirectedGraph

Returns the set of Edges which are inbound to the Vertex.

getInbound(V) - Method in class org.apache.commons.graph.model.DirectedMutableGraph

Returns the set of Edges which are inbound to the Vertex.

getLabel() - Method in interface org.apache.commons.graph.Labeled

Gets the label attribute of the Labeled object.

getOutbound(V) - Method in interface org.apache.commons.graph.DirectedGraph

Returns the set of Edges which lead away from the Vertex.

getOutbound(V) - Method in class org.apache.commons.graph.model.DirectedMutableGraph

Returns the set of Edges which lead away from the Vertex.

getSource() - Method in class org.apache.commons.graph.model.InMemoryPath

Returns the source of the path.

getSource() - Method in interface org.apache.commons.graph.Path

Returns the source of the path.

getTail() - Method in interface org.apache.commons.graph.Edge

Return the tail of this edge.

getTarget() - Method in class org.apache.commons.graph.model.InMemoryPath

Returns the target of the path.

getTarget() - Method in interface org.apache.commons.graph.Path

Returns the target of the path.

getVertices() - Method in interface org.apache.commons.graph.Graph

Returns the total set of Vertices in the graph.

getVertices(E) - Method in interface org.apache.commons.graph.Graph

Return the set of Vertex on the input Edge (2 for normal edges, > 2 for HyperEdges)

getVertices() - Method in class org.apache.commons.graph.model.BaseGraph

Returns the total set of Vertices in the graph.

getVertices(E) - Method in class org.apache.commons.graph.model.BaseGraph

Return the set of Vertex on the input Edge (2 for normal edges, > 2 for HyperEdges)

getVertices() - Method in class org.apache.commons.graph.model.InMemoryPath

getVertices() - This returns a list of Vertices, in order as they go from Start to End.

getVertices() - Method in interface org.apache.commons.graph.Path

getVertices() - This returns a list of Vertices, in order as they go from Start to End.

getWeight() - Method in class org.apache.commons.graph.model.InMemoryPath

Gets the weight attribute of the WeightedPath object.

getWeight() - Method in interface org.apache.commons.graph.WeightedEdge

Gets the weight attribute of the WeightedEdge object

getWeight() - Method in interface org.apache.commons.graph.WeightedPath

Gets the weight attribute of the WeightedPath object.

Graph<V extends Vertex,E extends Edge<V>> - Interface in org.apache.commons.graph

A Graph data structure consists of a finite (and possibly mutable) set of ordered pairs, called Edges or arcs, of certain entities called Vertex or node.

GraphException - Exception in org.apache.commons.graph

GraphException This is the superclass of all exceptions that can be thrown.

GraphException() - Constructor for exception org.apache.commons.graph.GraphException

Constructs a new graph exception.

GraphException(String) - Constructor for exception org.apache.commons.graph.GraphException

Constructs a new graph exception with the specified detail message.

GraphException(Throwable) - Constructor for exception org.apache.commons.graph.GraphException

Constructs a new graph exception with the specified cause.

GraphException(String, Throwable) - Constructor for exception org.apache.commons.graph.GraphException

Constructs a new graph exception with the specified detail message and cause.

GraphVisitHandler<V extends Vertex,E extends Edge<V>> - Interface in org.apache.commons.graph.visit

Description of the Interface

H

hashCode() - Method in class org.apache.commons.graph.model.InMemoryPath

I

InMemoryPath<V extends Vertex,WE extends WeightedEdge<V>> - Class in org.apache.commons.graph.model

Support WeightedPath implementation, optimized for algorithms (such Dijkstra's) that need to rebuild the path traversing the predecessor list bottom-up.

InMemoryPath(V, V, Double) - Constructor for class org.apache.commons.graph.model.InMemoryPath

K

Kruskal - Class in org.apache.commons.graph.spanning

Kruskal's algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connected weighted graph.

Kruskal() - Constructor for class org.apache.commons.graph.spanning.Kruskal

L

Labeled - Interface in org.apache.commons.graph

A Label is an identifier to be assigned to a Vertex or to an Edge.

LabeledEdge<V extends Vertex> - Interface in org.apache.commons.graph

An edge labeling is a function mapping Edges of a Graph to a set of labels.

LabeledVertex - Interface in org.apache.commons.graph

A vertex labeling is a function mapping a set of Vertex of a Graph to a set of labels.

LabeledWeightedEdge<V extends Vertex> - Interface in org.apache.commons.graph

A LabeledEdge with weight.

M

minimumSpanningTree(WeightedGraph<V, WE>) - Static method in class org.apache.commons.graph.spanning.Boruvka

Calculates the minimum spanning tree (or forest) of the input Graph.

minimumSpanningTree(WeightedGraph<V, WE>) - Static method in class org.apache.commons.graph.spanning.Kruskal

Calculates the minimum spanning tree (or forest) of the input Graph.

minimumSpanningTree(WeightedGraph<V, WE>) - Static method in class org.apache.commons.graph.spanning.Prim

Calculates the minimum spanning tree (or forest) of the input Graph.

MutableDirectedGraph<V extends Vertex,E extends Edge<V>> - Interface in org.apache.commons.graph

The MutableDirectedGraph is a directed graph that supports the addition and removal of Vertex and Edges.

MutableGraph<V extends Vertex,E extends Edge<V>> - Interface in org.apache.commons.graph

The MutableGraph is a graph that supports the addition and removal of Vertex and Edges.

O

org.apache.commons.graph - package org.apache.commons.graph

Main APIs that describe Graph data structure.

org.apache.commons.graph.model - package org.apache.commons.graph.model

In-memory based data-structures implementations.

org.apache.commons.graph.shortestpath - package org.apache.commons.graph.shortestpath

Shortest Path algorithms implementations.

org.apache.commons.graph.spanning - package org.apache.commons.graph.spanning

Minimum spanning tree (forest) algorithms implementation.

org.apache.commons.graph.visit - package org.apache.commons.graph.visit

Visit algorithms implementation.

P

Path<V extends Vertex,E extends Edge<V>> - Interface in org.apache.commons.graph

A Path in a Graph is a sequence of Vertex such that from each of its vertices there is an Edge to the next Vertex in the sequence.

PathNotFoundException - Exception in org.apache.commons.graph.shortestpath

PathNotFoundException(String) - Constructor for exception org.apache.commons.graph.shortestpath.PathNotFoundException

Prim - Class in org.apache.commons.graph.spanning

Prim's algorithm is a greedy algorithm that finds a minimum spanning tree for a connected weighted undirected graph.

Prim() - Constructor for class org.apache.commons.graph.spanning.Prim

R

removeEdge(E) - Method in class org.apache.commons.graph.model.BaseMutableGraph

Removed the Edge from the MutableGraph object.

removeEdge(E) - Method in interface org.apache.commons.graph.MutableDirectedGraph

Adds a feature to the Edge attribute of the MutableDirectedGraph object

removeEdge(E) - Method in interface org.apache.commons.graph.MutableGraph

Removed the Edge from the MutableGraph object.

removeVertex(V) - Method in class org.apache.commons.graph.model.BaseMutableGraph

Removes the Vertex from the MutableGraph object.

removeVertex(V) - Method in interface org.apache.commons.graph.MutableDirectedGraph

Removes the Vertex from the MutableGraph object.

removeVertex(V) - Method in interface org.apache.commons.graph.MutableGraph

Removes the Vertex from the MutableGraph object.

S

size() - Method in class org.apache.commons.graph.model.InMemoryPath

size() - This returns the size of the path in terms of number of verticies it visits.

size() - Method in interface org.apache.commons.graph.Path

size() - This returns the size of the path in terms of number of verticies it visits.

T

toString() - Method in class org.apache.commons.graph.model.InMemoryPath

U

UndirectedGraph<V extends Vertex,E extends Edge<V>> - Interface in org.apache.commons.graph

An UndirectedGraph is a graph in which edges have no orientation, i.e., they are not ordered pairs, but sets {u, v} (or 2-multisets) of vertices.

V

Vertex - Interface in org.apache.commons.graph

A Vertex or Node is the fundamental unit out of which graphs are formed.

Visit - Class in org.apache.commons.graph.visit

Contains different implementations of Graph visitor algorithms.

W

WeightedEdge<V extends Vertex> - Interface in org.apache.commons.graph

A WeightedEdge is an Edge where a number (weight) is assigned to represent, for example, costs, lengths or capacities, etc.

WeightedGraph<V extends Vertex,WE extends WeightedEdge<V>> - Interface in org.apache.commons.graph

A graph is a WeightedGraph if a number (weight) is assigned to each edge.

WeightedPath<V extends Vertex,WE extends WeightedEdge<V>> - Interface in org.apache.commons.graph

A Path where Edge are weighted.

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