public class BasicPath<N,E> extends AbstractPath<N,E>
Path.Direction| Modifier and Type | Field and Description |
|---|---|
protected List<Edge<N,E>> |
list |
direction| Constructor and Description |
|---|
BasicPath() |
| Modifier and Type | Method and Description |
|---|---|
boolean |
add(Edge<N,E> e) |
void |
add(int index,
Edge<N,E> element) |
boolean |
addAll(Collection<? extends Edge<N,E>> c) |
boolean |
addAll(int index,
Collection<? extends Edge<N,E>> c) |
void |
clear() |
boolean |
contains(Object o) |
boolean |
containsAll(Collection<?> c) |
boolean |
equals(Object o) |
Edge<N,E> |
get(int index) |
int |
hashCode() |
int |
indexOf(Object o) |
boolean |
isEmpty() |
Iterator<Edge<N,E>> |
iterator() |
int |
lastIndexOf(Object o) |
ListIterator<Edge<N,E>> |
listIterator() |
ListIterator<Edge<N,E>> |
listIterator(int index) |
Edge<N,E> |
remove(int index) |
boolean |
remove(Object o) |
boolean |
removeAll(Collection<?> c) |
boolean |
retainAll(Collection<?> c) |
Edge<N,E> |
set(int index,
Edge<N,E> element) |
int |
size() |
List<Edge<N,E>> |
subList(int fromIndex,
int toIndex) |
Object[] |
toArray() |
<T> T[] |
toArray(T[] a) |
contains, getDirection, getLastEdge, getLastNode, setDirectionclone, finalize, getClass, notify, notifyAll, toString, wait, wait, waitreplaceAll, sort, spliteratorparallelStream, removeIf, streampublic <T> T[] toArray(T[] a)
public Object[] toArray()
public int size()
public boolean retainAll(Collection<?> c)
public boolean removeAll(Collection<?> c)
public boolean remove(Object o)
public ListIterator<Edge<N,E>> listIterator(int index)
public ListIterator<Edge<N,E>> listIterator()
public int lastIndexOf(Object o)
public boolean isEmpty()
public int indexOf(Object o)
public int hashCode()
public boolean equals(Object o)
public boolean containsAll(Collection<?> c)
public boolean contains(Object o)
public void clear()
public boolean addAll(int index,
Collection<? extends Edge<N,E>> c)
public boolean addAll(Collection<? extends Edge<N,E>> c)
Copyright © 2017. All rights reserved.