Package gov.nih.mipav.model.algorithms

Class AlgorithmObjectExtractor.Edge

java.lang.Object

gov.nih.mipav.model.algorithms.AlgorithmObjectExtractor.Edge

Enclosing class:

AlgorithmObjectExtractor

protected class AlgorithmObjectExtractor.Edge
extends java.lang.Object

A representation of an edge for the vertex-edge-triangle table. This class stores the pair of vertex indices for the end points of the edge. The edges and are considered to be identical. To simplify comparisons, the class stores the ordered indices. The class extends Object to obtain support for hashing into a map of edges.

Field Summary

Fields

Modifier and Type	Field	Description
int	m_i0	DOCUMENT ME!
int	m_i1	DOCUMENT ME!

Constructor Summary

Constructors

Constructor	Description
Edge(int i0, int i1)	Constructs an edge in the table.

Method Summary

Modifier and Type	Method	Description
boolean	equals(java.lang.Object kObject)	Support for hashing into a map of edges.
int	hashCode()	Support for hashing into a map of edges.

Methods inherited from class java.lang.Object

clone, finalize, getClass, notify, notifyAll, toString, wait, wait, wait

Field Detail

m_i0

public int m_i0

DOCUMENT ME!

m_i1

public int m_i1

DOCUMENT ME!

Constructor Detail

Edge

public Edge(int i0,
            int i1)

Constructs an edge in the table.

Parameters:

i0 - a vertex index for an end point

i1 - a vertex index for an end point

Method Detail

equals

public boolean equals(java.lang.Object kObject)

Support for hashing into a map of edges.

Overrides:

equals in class java.lang.Object

Parameters:

kObject - an edge for comparison to the current one

Returns:

true iff the edges are identical. Because the class stores ordered indices, it is not necessary to use the more expensive test (i0 == other.i0 && i1 == other.i1) || (i0 == other.i1 && i1 == other.i0).

hashCode

public int hashCode()

Support for hashing into a map of edges.

Overrides:

hashCode in class java.lang.Object

Returns:

the hash key for the edge