java.lang.Object
org.jgrapht.opt.graph.fastutil.FastutilFastLookupGSS<V,E>
- Type Parameters:
V
- the graph vertex typeE
- 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 Summary
-
Method Summary
Modifier and TypeMethodDescriptionGet a function which creates the intrusive edges specifics.Get a function which creates the specifics.Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
Methods inherited from interface org.jgrapht.graph.GraphSpecificsStrategy
getEdgeSetFactory
-
Constructor Details
-
FastutilFastLookupGSS
public FastutilFastLookupGSS()
-
-
Method Details
-
getSpecificsFactory
Description copied from interface:GraphSpecificsStrategy
Get a function which creates the specifics. The factory will accept the graph type as a parameter.- Specified by:
getSpecificsFactory
in interfaceGraphSpecificsStrategy<V,
E> - Returns:
- a function which creates intrusive edges specifics.
-
getIntrusiveEdgesSpecificsFactory
Description copied from interface:GraphSpecificsStrategy
Get 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:
getIntrusiveEdgesSpecificsFactory
in interfaceGraphSpecificsStrategy<V,
E> - Returns:
- a function which creates intrusive edges specifics.
-