DoublyLinkedList.ListNodeIterator (JGraphT : a free Java graph library)

Type Parameters:

E - the list element type

All Superinterfaces:

DoublyLinkedList.NodeIterator<E>, java.util.Iterator<E>, java.util.ListIterator<E>

Enclosing class:

DoublyLinkedList<E>
```
public static interface DoublyLinkedList.ListNodeIterator<E>
extends java.util.ListIterator<E>, DoublyLinkedList.NodeIterator<E>
```
An extension of the ListIterator interface for DoublyLinkedLists exposing their ListNodes.

Method Summary

All Methods Instance Methods Abstract Methods Default Methods
Modifier and Type	Method	Description
`default E`	`next()`
`default E`	`previous()`
`DoublyLinkedList.ListNode<E>`	`previousNode()`	Returns the previous `DoublyLinkedList.ListNode` in the list and moves the cursor position backwards.

Methods inherited from interface org.jgrapht.util.DoublyLinkedList.NodeIterator
nextNode

Methods inherited from interface java.util.Iterator
forEachRemaining

Methods inherited from interface java.util.ListIterator
add, hasNext, hasPrevious, nextIndex, previousIndex, remove, set

- Method Detail
  - next
```
default E next()
```
    Specified by:
    
    next in interface DoublyLinkedList.NodeIterator<E>
    
    Specified by:
    
    next in interface java.util.Iterator<E>
    
    Specified by:
    
    next in interface java.util.ListIterator<E>
  - previous
```
default E previous()
```
    Specified by:
    
    previous in interface java.util.ListIterator<E>
  - previousNode
```
DoublyLinkedList.ListNode<E> previousNode()
```
    Returns the previous DoublyLinkedList.ListNode in the list and moves the cursor position backwards.
    
    Returns:
    
    the previous ListNode
    
    See Also:
    
    ListIterator.previous()