java.lang.Object
org.jgrapht.opt.graph.fastutil.FastutilFastLookupGSS<V,E> 
- Type Parameters:
- V- the graph vertex type
- E- the graph edge type
- All Implemented Interfaces:
- Serializable,- GraphSpecificsStrategy<V,- E> 
The fast lookup specifics strategy implementation using fastutil maps for storage..
 
 
 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 FastutilGSS instead.
- Author:
- Dimitrios Michail
- See Also:
- 
Constructor SummaryConstructors
- 
Method SummaryModifier and TypeMethodDescriptionGet a function which creates the intrusive edges specifics.Get a function which creates the specifics.Methods inherited from class java.lang.Objectclone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitMethods inherited from interface org.jgrapht.graph.GraphSpecificsStrategygetEdgeSetFactory
- 
Constructor Details- 
FastutilFastLookupGSSpublic FastutilFastLookupGSS()
 
- 
- 
Method Details- 
getSpecificsFactoryDescription copied from interface:GraphSpecificsStrategyGet a function which creates the specifics. The factory will accept the graph type as a parameter.- Specified by:
- getSpecificsFactoryin interface- GraphSpecificsStrategy<V,- E> 
- Returns:
- a function which creates intrusive edges specifics.
 
- 
getIntrusiveEdgesSpecificsFactoryDescription copied from interface:GraphSpecificsStrategyGet a function which creates the intrusive edges specifics. The factory will accept the graph type as a parameter.Note that it is very important to use a map implementation which respects iteration order. - Specified by:
- getIntrusiveEdgesSpecificsFactoryin interface- GraphSpecificsStrategy<V,- E> 
- Returns:
- a function which creates intrusive edges specifics.
 
 
-