Expand description
NPath - path representation of a linked list structure
Refer to nebula-graph’s NPath design for prefix sharing using shared ownership. For scenarios where frequent path expansion is required in graph traversal.
§Core strengths
- Shared prefix: multiple paths share the same prefix portion to save memory
- **O(1) Extension **: New path simply creates a new node pointing to parent path
- Fast splicing: bi-directional BFS path splicing by simply finding the point of intersection
Modules§
- utils
- NPath utility functions
Structs§
- NPath
- NPath - path representation of a linked list structure
- NPath
Edge Iter - NPath edge iterator – Lazy traversal of all edges
- NPath
Iter - NPath iterator – Traverses all nodes (from the end point to the start point)
- NPath
Vertex Iter - NPath vertex iterator – Lazy traversal of all vertices