Struct NodeRef 

pub struct NodeRef<'a, F: Fs> { /* private fields */ }

Implementations

impl<'a, F: Fs> NodeRef<'a, F>

pub fn key(&self) -> &str

pub fn label(&self) -> &str

pub fn prop(&self, field: &str) -> Option<&Value>

pub fn props(&self) -> BTreeMap<String, Value>

All stored fields for this node, sorted by field name.

pub fn neighborhood( &self, depth: u32, edge_types: Option<&[&str]>, dir: Dir, ) -> ResultSet

depth-N BFS as a ResultSet: columns [“key”,“label”,“depth”], BFS order.

pub fn grouped_by_edge_type(&self) -> BTreeMap<String, Vec<String>>

1-hop, Both directions: edge-type name → sorted unique neighbor keys.