de.aitools.aq.graph.weighted
Interface UndirectedGraph<V>

Type Parameters:

V - The vertices in this graph.

All Superinterfaces:

java.lang.Iterable<V>

All Known Subinterfaces:

UndirectedMutableGraph<V>

All Known Implementing Classes:

ComparablesUndirectedGraph, GeneralUndirectedGraph

Deprecated. see package de.aitools.aq.structure.graph

public interface UndirectedGraph<V>
extends java.lang.Iterable<V>

An undirected weighted graph.

Version:

$Id: UndirectedGraph.java,v 1.2 2011/09/29 12:43:03 dogu3912 Exp $

Author:

johannes.kiesel(/\t)uni-weimar.de

See Also:

UndirectedMutableGraph

Nested Class Summary

static interface

UndirectedGraph.Edge<V> Deprecated. A possible edge connecting two vertices of an underlying UndirectedGraph.

Field Summary

static double

DEFAULT_UNCONNECTED_WEIGHT Deprecated. The default weight for two not connected vertices.

Method Summary

boolean	containsEdge(V vertexA, V vertexB) Deprecated. Check if there exists an edge in the graph connecting the two vertices given as parameters.
boolean	containsVertex(V vertex) Deprecated. Check if given vertex is contained in the graph.
java.util.Iterator<? extends UndirectedGraph.Edge<V>>	edges() Deprecated. Get an iterator over all edges of the graph.
java.util.Iterator<? extends UndirectedGraph.Edge<V>>	edgesConnectedTo(V vertex) Deprecated. Get an iterator over all edges in the graph, given vertex is connected with.
UndirectedGraph.Edge<V>	getEdge(V vertexA, V vertexB) Deprecated. Get the UndirectedGraph.Edge connecting the two vertices.
double	getEdgeWeight(V vertexA, V vertexB) Deprecated. Get the weight of the edge connecting the two vertices.
double	getUnconnectedWeight() Deprecated. The method getEdgeWeight(Object, Object) returns a double value for any possible edge connecting two vertices in the graph.
int	numEdges() Deprecated. Get the number of edges.
int	numEdges(V vertex) Deprecated.
int	numVertices() Deprecated. Get the number of vertices.
java.util.Iterator<V>	vertices() Deprecated. Get an iterator over all current vertices of this graph.
java.util.Iterator<V>	verticesConnectedTo(V vertex) Deprecated. Get an iterator over all vertices that are connected with given vertex at the moment of this call.

Methods inherited from interface java.lang.Iterable

iterator

Field Detail

DEFAULT_UNCONNECTED_WEIGHT

static final double DEFAULT_UNCONNECTED_WEIGHT

Deprecated.

The default weight for two not connected vertices. If an edge was removed or simply not set yet, this should by default be it's weight.

See Also:

Constant Field Values

Method Detail

getUnconnectedWeight

double getUnconnectedWeight()

Deprecated.

The method getEdgeWeight(Object, Object) returns a double value for any possible edge connecting two vertices in the graph. If an edge does not exist, the method will return this value.

Returns:

A weight for not existing edges.

numVertices

int numVertices()

Deprecated.

Get the number of vertices.

Returns:

The number of vertices in the graph.

numEdges

int numEdges()

Deprecated.

Get the number of edges.

Returns:

The number of edges in the graph.

numEdges

int numEdges(V vertex)

Deprecated.

Parameters:

vertex - Which vertex to count edges of.

Returns:

The number of edges this vertex is connected with.

Throws:

java.util.NoSuchElementException - If the vertex is not part of the graph.

java.lang.NullPointerException - If vertex is null.

vertices

java.util.Iterator<V> vertices()

Deprecated.

Get an iterator over all current vertices of this graph. This is the same as calling Iterable.iterator().

Returns:

The iterator.

See Also:

numVertices()

verticesConnectedTo

java.util.Iterator<V> verticesConnectedTo(V vertex)

Deprecated.

Get an iterator over all vertices that are connected with given vertex at the moment of this call.

Parameters:

vertex - The vertex.

Returns:

The iterator.

Throws:

java.util.NoSuchElementException - If the vertex is not part of the graph.

java.lang.NullPointerException - If vertex is null.

See Also:

numEdges(Object)

edges

java.util.Iterator<? extends UndirectedGraph.Edge<V>> edges()

Deprecated.

Get an iterator over all edges of the graph. Each edge is only visited once.

Returns:

The iterator.

See Also:

numEdges()

edgesConnectedTo

java.util.Iterator<? extends UndirectedGraph.Edge<V>> edgesConnectedTo(V vertex)

Deprecated.

Get an iterator over all edges in the graph, given vertex is connected with.

Parameters:

vertex - The vertex.

Returns:

The iterator.

Throws:

java.util.NoSuchElementException - If the vertex is not part of the graph.

java.lang.NullPointerException - If vertex is null.

See Also:

numEdges(Object)

containsVertex

boolean containsVertex(V vertex)

Deprecated.

Check if given vertex is contained in the graph.

Parameters:

vertex - The vertex to look for.

Returns:

True if the vertex is contained. False otherwise.

Throws:

java.lang.NullPointerException - If vertex is null.

containsEdge

boolean containsEdge(V vertexA,
                     V vertexB)

Deprecated.

Check if there exists an edge in the graph connecting the two vertices given as parameters.

Parameters:

vertexA - One vertex.

vertexB - The other vertex.

Returns:

True if both vertices are connected.

Throws:

java.util.NoSuchElementException - If at least one of the vertices is not part of the graph.

java.lang.NullPointerException - If one of the vertices is null.

getEdgeWeight

double getEdgeWeight(V vertexA,
                     V vertexB)

Deprecated.

Get the weight of the edge connecting the two vertices. This will return getUnconnectedWeight() if the two vertices are not connected.

Parameters:

vertexA - One vertex.

vertexB - The other vertex.

Returns:

The weight of the edge or getUnconnectedWeight().

Throws:

java.util.NoSuchElementException - If at least one of the vertices is not part of the graph.

java.lang.NullPointerException - If one of the vertices is null.

See Also:

containsEdge(Object, Object), getEdge(Object, Object)

getEdge

UndirectedGraph.Edge<V> getEdge(V vertexA,
                                V vertexB)

Deprecated.

Get the UndirectedGraph.Edge connecting the two vertices. The object will also be returned if there does not exists such an edge in the graph. Use UndirectedGraph.Edge.exists() to check.

Parameters:

vertexA - One vertex.

vertexB - The other vertex.

Returns:

The edge.

Throws:

java.util.NoSuchElementException - If at least one of the vertices is not part of the graph.

java.lang.NullPointerException - If one of the vertices is null.

See Also:

containsEdge(Object, Object), getEdgeWeight(Object, Object)