org.rollerjm.graph
Class Dijkstra.PriorityQueue.QueueElement

java.lang.Object
  |
  +--org.rollerjm.graph.Dijkstra.PriorityQueue.QueueElement

All Implemented Interfaces:

java.lang.Comparable

Enclosing class:

Dijkstra.PriorityQueue

class Dijkstra.PriorityQueue.QueueElement

extends java.lang.Object

implements java.lang.Comparable

Title: graphs

Description: element of the Queue. It contains an object and his priority. Implements Compartable to be used by the TreeSet.

Copyright: Copyright (c) 2002

Company:

Version:

1.0

Author:

Jean-Michel Garnier

Field Summary

java.lang.Object	element any object
int	priority Priority.

Constructor Summary

Dijkstra.PriorityQueue.QueueElement(java.lang.Object element, int priority)

Method Summary

int	compareTo(java.lang.Object o) Implementation of compareTo

Methods inherited from class java.lang.Object

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

Field Detail

element

public java.lang.Object element

any object

priority

public int priority

Priority. Must be >= 0

Constructor Detail

Dijkstra.PriorityQueue.QueueElement

public Dijkstra.PriorityQueue.QueueElement(java.lang.Object element,
                                           int priority)

Parameters:

element -

priority -

Method Detail

compareTo

public int compareTo(java.lang.Object o)

Implementation of compareTo

Specified by:

compareTo in interface java.lang.Comparable

Parameters:

o -

Returns:

int a negative integer, zero, or a positive integer as the priority of this object is less than, equal to, or greater than the specified object.