Package org.jgrapht.opt.graph.fastutil
Class FastutilGSS<V,E>
- java.lang.Object
-
- org.jgrapht.opt.graph.fastutil.FastutilGSS<V,E>
-
- Type Parameters:
V- the graph vertex typeE- the graph edge type
- All Implemented Interfaces:
java.io.Serializable,org.jgrapht.graph.GraphSpecificsStrategy<V,E>
public class FastutilGSS<V,E> extends java.lang.Object implements org.jgrapht.graph.GraphSpecificsStrategy<V,E>A specifics strategy implementation using fastutil maps for storage.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
FastutilFastLookupGSS.- Author:
- Dimitrios Michail
- See Also:
- Serialized Form
-
-
Constructor Summary
Constructors Constructor Description FastutilGSS()
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description java.util.function.Function<org.jgrapht.GraphType,org.jgrapht.graph.IntrusiveEdgesSpecifics<V,E>>getIntrusiveEdgesSpecificsFactory()java.util.function.BiFunction<org.jgrapht.Graph<V,E>,org.jgrapht.GraphType,org.jgrapht.graph.specifics.Specifics<V,E>>getSpecificsFactory()
-