V- the graph vertex type
E- the graph edge type
public class FastutilFastLookupGSS<V,E> extends Object implements GraphSpecificsStrategy<V,E>
Graphs constructed using this strategy use additional data structures to improve the performance
of methods which depend on edge retrievals, e.g. getEdge(V u, V v), containsEdge(V u, V
v),addEdge(V u, V v). A disadvantage is an increase in memory consumption. If memory utilization
is an issue, use the
|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 BiFunction<Graph<V,E>,GraphType,Specifics<V,E>> getSpecificsFactory()
public Function<GraphType,IntrusiveEdgesSpecifics<V,E>> getIntrusiveEdgesSpecificsFactory()
Note that it is very important to use a map implementation which respects iteration order.
Copyright © 2019. All rights reserved.