public class Path<N,E> extends AbstractList<E>
| Modifier and Type | Class and Description |
|---|---|
static class |
Path.PathData<N,E> |
modCount| Constructor and Description |
|---|
Path(IndefiniteGraph<N,E> graph,
N start,
List<? extends E> edgeList) |
| Modifier and Type | Method and Description |
|---|---|
List<? extends E> |
edgeList() |
N |
endNode() |
E |
firstEdge() |
N |
firstNode() |
E |
get(int index) |
boolean |
isEmpty() |
Iterator<E> |
iterator() |
E |
lastEdge() |
Iterator<N> |
nodeIterator() |
List<N> |
nodeList() |
Iterable<N> |
nodes() |
int |
size() |
add, add, addAll, clear, equals, hashCode, indexOf, lastIndexOf, listIterator, listIterator, remove, removeRange, set, subListaddAll, contains, containsAll, remove, removeAll, retainAll, toArray, toArray, toStringpublic Iterator<N> nodeIterator()
public int size()
size in interface Collection<E>size in interface List<E>size in class AbstractCollection<E>public boolean isEmpty()
isEmpty in interface Collection<E>isEmpty in interface List<E>isEmpty in class AbstractCollection<E>Copyright © 2013. All Rights Reserved.