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

Type Parameters:

E - the list element type

All Superinterfaces:

java.util.Iterator<E>

All Known Subinterfaces:

DoublyLinkedList.ListNodeIterator<E>

Enclosing class:

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

Method Summary

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

Methods inherited from interface java.util.Iterator
forEachRemaining, hasNext, remove

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