Struct NPath 

pub struct NPath { /* private fields */ }

NPath - path representation of a linked list structure

Shared ownership via Arc using immutable data structures. Each node contains a vertex and an edge (other than the starting point) that reaches that vertex.

Implementations

impl NPath

pub fn new(vertex: Arc<Vertex>) -> Self

Creating a Starting Path

Parameters

• vertex - starting vertex

pub fn extend(parent: Arc<NPath>, edge: Arc<Edge>, vertex: Arc<Vertex>) -> Self

Extended Path - O(1) Operation

Creates a new path node that points to the parent path for prefix sharing.

Parameters

• parent - parent path
• edge - the edge that reaches the new vertex
• vertex - new vertex

pub fn extend_with_set( parent: Arc<NPath>, edge: Arc<Edge>, vertex: Arc<Vertex>, seen_vertices: &mut HashSet<VertexId>, ) -> Option<Self>

Extend path and check for loops - O(1) averaging time

Fast detection of loop formation using HashSet, suitable for early pruning in DFS exploration.

Parameters

• parent - parent path
• edge - the edge that reaches the new vertex
• vertex - new vertex
• :: seen_vertices - set of visited vertices

Back

• Some(NPath) - extension successful
• None - loop detected

Example

let mut seen = HashSet::new();
seen.insert(parent.vertex.vid.as_ref().clone());
if let Some(extended) = NPath::extend_with_set(parent, edge, vertex, &mut seen) {
}

pub fn from_path(path: &Path) -> Arc<Self>

Create NPath from Path

Facilitates compatibility with existing interfaces, converting traditional Path to NPath.

Parameters

• :: path – traditional Path structure

Example

let npath = NPath::from_path(&path);

pub fn len(&self) -> usize

Get path length (number of edges)

pub fn is_empty(&self) -> bool

Check if the path is empty (contains only the starting point)

pub fn vertex(&self) -> &Arc<Vertex>

Get current vertex

pub fn edge(&self) -> Option<&Arc<Edge>>

Get the edge that reaches the current vertex

pub fn parent(&self) -> Option<&Arc<NPath>>

Get Parent Path

pub fn start_vertex(&self) -> &Arc<Vertex>

Get start vertex

pub fn end_vertex(&self) -> &Arc<Vertex>

Get end vertex (current vertex)

pub fn to_path(&self) -> Path

Translate the text into “Path” (and convert it further if necessary):

Time complexity: O(n), n is the path length

pub fn contains_vertex(&self, vid: &VertexId) -> bool

pub fn contains_edge(&self, edge_key: &(VertexId, VertexId, String)) -> bool

pub fn has_common_vertices(&self, other: &NPath) -> bool

pub fn collect_vertex_ids(&self) -> Vec<VertexId>

pub fn collect_edges(&self) -> Vec<Arc<Edge>>

Collect all the edges.

pub fn iter_vertices(&self) -> NPathVertexIter<'_>

Iterator: All vertices from the starting point to the current node.

pub fn iter_edges(&self) -> NPathEdgeIter<'_>

Iterator: All edges from the starting point to the current node

pub fn iter(&self) -> NPathIter<'_>

Iterator: All nodes from the starting point to the current node.

pub fn hash(&self) -> u64

Obtain the path hash

Trait Implementations

impl Clone for NPath

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for NPath

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Eq for NPath

impl PartialEq for NPath

fn eq(&self, other: &Self) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.