edu.uci.ics.dillenco.simplegraph01
Class QEdgeMap<V>

java.lang.Object
  edu.uci.ics.dillenco.simplegraph01.QEdgeMap<V>

public final class QEdgeMap<V>
extends Object

This class maps qEdges of a given graph to user-defined attributes. it provides a scaled-down version of mapping: only put, get, clear, and isEmpty are supported.

Constructor Summary

QEdgeMap(Graph g)
Create an empty QEdgeMap for the given graph.

Method Summary

void	clear() Remove all stored values in this map
V	get(HalfEdge halfEdge) Retrieve the value associated with the QEdge to which the given HalfEdge belongs.
V	get(QEdge qEdge) Retrieve the value associated with the given QEdge.
boolean	isEmpty() Return whether this map is currently empty.
V	put(QEdge qEdge, V value) Store a <QEdge,V> pair.

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

QEdgeMap

public QEdgeMap(Graph g)

Create an empty QEdgeMap for the given graph.

Parameters:

g - the graph with which this map is to be associated.

Method Detail

put

public V put(QEdge qEdge,
             V value)

Store a <QEdge,V> pair.

Parameters:

qEdge - the QEdge for the pair, which functions as the key

value - the associated value

Returns:

the previous value associated with the QEdge, or null if there was no previous mapping for the QEdge.

get

public V get(QEdge qEdge)

Retrieve the value associated with the given QEdge.

Parameters:

qEdge - the qEdge

Returns:

the associated value.

get

public V get(HalfEdge halfEdge)

Retrieve the value associated with the QEdge to which the given HalfEdge belongs. Equivalent to get(halfEdge.getQedge()}

Parameters:

halfEdge - the HalfEdge

Returns:

the associated value.

clear

public void clear()

Remove all stored values in this map

isEmpty

public boolean isEmpty()

Return whether this map is currently empty.

Returns:

true if the map is empty.