V
- the graph vertex typeE
- the graph edge typepublic class DefaultGraphSpecificsStrategy<V,E> extends Object implements GraphSpecificsStrategy<V,E>
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 FastLookupGraphSpecificsStrategy
.
Constructor and Description |
---|
DefaultGraphSpecificsStrategy() |
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, wait
getEdgeSetFactory
public Function<GraphType,IntrusiveEdgesSpecifics<V,E>> getIntrusiveEdgesSpecificsFactory()
GraphSpecificsStrategy
Note 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()
GraphSpecificsStrategy
getSpecificsFactory
in interface GraphSpecificsStrategy<V,E>
Copyright © 2019. All rights reserved.