Crate issundb_core

Structs§

DirectedNeighborEntry: A neighbor entry with a direction flag, returned by crate::Graph::all_neighbors.
EdgeRecord: Stored in the edges LMDB sub-database as msgpack bytes.
Graph: The graph database handle. Cheap to clone: all state is behind Arc.
NeighborEntry: The result of a single adjacency lookup entry returned by crate::Graph::out_neighbors and crate::Graph::in_neighbors.
NodeRecord: Stored in the nodes LMDB sub-database as msgpack bytes.
ReadTxn: A read-only transaction on the graph.
TriangleCountSpec: Pattern description for Graph::count_triangle_cycles: the directed cycle (a)-[t1]->(b)-[t2]->(c)-[t3]->(a) with an optional relationship type per hop and an optional label per node variable. None means unconstrained.
WeightedPath: A path with an associated total weight, returned by weighted path algorithms.
WriteTxn: A read-write transaction on the graph.