ConcurrentHashMapDynamicGraph
Related Doc:
package graph
Add an edge from srcId to destId.
Add an edge from srcId to destId.
Get the total number of edges in the graph.
Get the total number of edges in the graph. It's a very slow function. Use it carefully.
Get a node given a nodeId id.
Get a node given a nodeId id. Returns None if the id is not in the graph.
Get or create a node given a nodeId id and return it.
Get or create a node given a nodeId id and return it.
Checks if the given graph dir is stored in this graph
Checks if the given graph dir is stored in this graph
the graph dir in question
if the current graph stores the query graph direction
The label of a node accessed by name.
The label of a node accessed by name. Label can be anything.
Don't support this operator.
Don't support this operator. It always throws exceptions.
Get the total number of nodes in the graph.
Get the total number of nodes in the graph.
Labels on nodes of this graph.
Labels on nodes of this graph.
Remove an edge edgeId) from a node {@code id.
Remove an edge edgeId) from a node {@code id. isOut indicates
whether it's in edge (Some(false)), out edge (Some(true)), or both (None).
(Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.
Describes whether the stored graph is only in-directions, out-directions or both
Describes whether the stored graph is only in-directions, out-directions or both
Added default toString for debugging (prints max of 10 nodes)
Added default toString for debugging (prints max of 10 nodes)
(Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.
An efficient dynamic graph implementation which supports concurrent reading and writing. Reads happen without locks or data copying. Nodes are stored in a ConcurrentHashMap, and neighbors of each node are stored in Array[Int]s. Currently, only edge and node addition (not deletion) is supported.