V - the graph vertex typeE - the graph edge typepublic class FastLookupGraphSpecificsStrategy<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 DefaultGraphSpecificsStrategy instead.
| Constructor and Description | 
|---|
FastLookupGraphSpecificsStrategy()  | 
| Modifier and Type | Method and Description | 
|---|---|
Function<GraphType,IntrusiveEdgesSpecifics<V,E>> | 
getIntrusiveEdgesSpecificsFactory()
Get a function which creates the intrusive edges specifics. 
 | 
BiFunction<Graph<V,E>,GraphType,Specifics<V,E>> | 
getSpecificsFactory()
Get a function which creates the specifics. 
 | 
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitgetEdgeSetFactorypublic Function<GraphType,IntrusiveEdgesSpecifics<V,E>> getIntrusiveEdgesSpecificsFactory()
GraphSpecificsStrategyNote that it is very important to use a map implementation which respects iteration order.
getIntrusiveEdgesSpecificsFactory in interface GraphSpecificsStrategy<V,E>public BiFunction<Graph<V,E>,GraphType,Specifics<V,E>> getSpecificsFactory()
GraphSpecificsStrategygetSpecificsFactory in interface GraphSpecificsStrategy<V,E>Copyright © 2019. All rights reserved.