V- the graph vertex type
E- the graph edge type
public class DefaultGraphSpecificsStrategy<V,E> extends Object implements GraphSpecificsStrategy<V,E>
Graphs constructed using this strategy require the least amount of memory, at the expense of slow
edge retrievals. Methods which depend on edge retrievals, e.g. getEdge(V u, V v), containsEdge(V
u, V v), addEdge(V u, V v), etc may be relatively slow when the average degree of a vertex is
high (dense graphs). For a fast implementation, use
|Constructor and Description|
|Modifier and Type||Method and Description|
Get a function which creates the intrusive edges specifics.
Get a function which creates the specifics.
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
public Function<GraphType,IntrusiveEdgesSpecifics<V,E>> getIntrusiveEdgesSpecificsFactory()
Note that it is very important to use a map implementation which respects iteration order.
Copyright © 2018. All rights reserved.