edu.ucsb.cs.jicos.applications.utilities.graph
Interface Graph

All Superinterfaces:

java.io.Serializable

All Known Implementing Classes:

GraphEuclidean, GraphImpl

public interface Graph
extends java.io.Serializable

Field Summary

static int	METRIC_EUC_2D
static int	METRIC_GEO

Method Summary

java.lang.String	costs2String()
int	getCost(int i, int j) Get an edge's cost, distance, weight, or capacity.
int[][]	getCosts() Get the graph's cost or distance matrix.
int[]	getMaxCostMaxMatch() Get a maximum cost maximum matching associated with this graph.
int[]	getMinCostMaxMatch() Get a minimum cost maximum matching associated with this graph.
int	size() Get the size of this graph: The number of vertices.
java.lang.String	toString() Get a string representation of the graph.

Field Detail

METRIC_GEO

static final int METRIC_GEO

See Also:

Constant Field Values

METRIC_EUC_2D

static final int METRIC_EUC_2D

See Also:

Constant Field Values

Method Detail

costs2String

java.lang.String costs2String()

getCost

int getCost(int i,
            int j)

Get an edge's cost, distance, weight, or capacity.

Parameters:

i - One endpoint of an edge.

j - One endpoint of an edge.

Returns:

The edge's cost, distance, weight, or capacity.

getCosts

int[][] getCosts()

Get the graph's cost or distance matrix.

Returns:

the cost or distance matrix.

getMinCostMaxMatch

int[] getMinCostMaxMatch()

Get a minimum cost maximum matching associated with this graph.

Returns:

a minimum cost maximum matching associated with this graph.

getMaxCostMaxMatch

int[] getMaxCostMaxMatch()

Get a maximum cost maximum matching associated with this graph.

Returns:

a maximum cost maximum matching associated with this graph.

size

int size()

Get the size of this graph: The number of vertices.

Returns:

number of vertices.

toString

java.lang.String toString()

Get a string representation of the graph.

Overrides:

toString in class java.lang.Object

Returns:

a string representation of the graph.