graph-core-0.2.0.1: Fast, memory efficient and persistent graph implementation (Index)

graph-core-0.2.0.1: Fast, memory efficient and persistent graph implementation

Index

addEdge	Data.Graph
addEdges	Data.Graph
addNode	Data.Graph
children	Data.Graph
Edge
1 (Type/Class)	Data.Graph
2 (Data Constructor)	Data.Graph
edgeCount	Data.Graph
edges	Data.Graph
edgesAdj	Data.Graph
empty	Data.Graph
emptyNode	Data.Graph.NodeManager
emptyNodeManager	Data.Graph.NodeManager
fromAdj	Data.Graph
fromEdges	Data.Graph
getExistingNodeHandle	Data.Graph.NodeManager
getNewNodesSince	Data.Graph.NodeManager
getNodeHandle	Data.Graph.NodeManager
getNodeMap	Data.Graph.NodeManager
Graph	Data.Graph
hasEdge	Data.Graph
hasKey	Data.Graph.NodeManager
hull	Data.Graph
hullFold	Data.Graph
hullFoldM	Data.Graph
initNodeManager	Data.Graph.NodeManager
isConsistent
1 (Function)	Data.Graph.NodeManager
2 (Function)	Data.Graph
keys	Data.Graph.NodeManager
loadGraph	Data.Graph.Persistence
lookupNode	Data.Graph.NodeManager
Node	Data.Graph.NodeManager, Data.Graph
NodeManager	Data.Graph.NodeManager
NodeMap	Data.Graph.NodeManager
nodes
1 (Function)	Data.Graph.NodeManager
2 (Function)	Data.Graph
NodeSet	Data.Graph.NodeManager, Data.Graph
parents	Data.Graph
PersistentGraph	Data.Graph.Persistence
persistGraph	Data.Graph.Persistence
removeEdge	Data.Graph
removeEdges	Data.Graph
removeNode	Data.Graph
removeNodeHandle	Data.Graph.NodeManager
rhull	Data.Graph
rhullFold	Data.Graph
solitaireNodes	Data.Graph
src	Data.Graph
tgt	Data.Graph
toList	Data.Graph.NodeManager
unsafeLookupNode	Data.Graph.NodeManager