V
- type of verticespublic interface Graph<V> extends Iterable<V>, AdjacencyGraph<V>
Modifier and Type | Method and Description |
---|---|
default boolean |
contains(V v) |
default boolean |
containsEdge(Edge<V> edge) |
default boolean |
containsEdge(V u,
V v) |
default List<Edge<V>> |
edges() |
default Stream<Edge<V>> |
edgeStream() |
default Supplier<BiFunction<V,V,Edge<V>>> |
edgeSupplier() |
default void |
forEachEdge(BiConsumer<V,V> action) |
default void |
forEachVertex(Consumer<? super V> action) |
default Edge<V> |
getEdge(V u,
V v) |
boolean |
isDirected() |
default long |
noOfEdges() |
default long |
noOfVertices() |
default String |
sortedEdgeStreamToString() |
default String |
str() |
default Stream<V> |
stream() |
default Set<V> |
vertices() |
forEach, iterator, spliterator
adjacentVertices, forEachAdjacentVertex
default long noOfVertices()
default void forEachEdge(BiConsumer<V,V> action)
default long noOfEdges()
boolean isDirected()
default boolean contains(V v)
default String str()
default String sortedEdgeStreamToString()
Copyright © 2014–2015. All rights reserved.