pub struct Subgraph {
pub nodes: Vec<Node>,
pub edges: Vec<Edge>,
}Expand description
A self-contained subgraph extracted from Neo4j.
Nodes and edges are stored by value and indexed by their Nulid
IDs. An adjacency list maps each node ID to its outgoing edges so
traversal does not require linear scans.
Fields§
§nodes: Vec<Node>§edges: Vec<Edge>Trait Implementations§
Source§impl<'de> Deserialize<'de> for Subgraph
impl<'de> Deserialize<'de> for Subgraph
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Auto Trait Implementations§
impl Freeze for Subgraph
impl RefUnwindSafe for Subgraph
impl Send for Subgraph
impl Sync for Subgraph
impl Unpin for Subgraph
impl UnsafeUnpin for Subgraph
impl UnwindSafe for Subgraph
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more