pub struct GraphSubgraph { /* private fields */ }Expand description
One selection into the raw graph, never a second graph.
Every identity indexes back into the graph the analysis borrows, which is where a caller resolves it. The selection owns no record, no evidence, and no serialized form of its own.
Implementations§
Source§impl GraphSubgraph
impl GraphSubgraph
Sourcepub fn nodes(&self) -> &[GraphNodeId] ⓘ
pub fn nodes(&self) -> &[GraphNodeId] ⓘ
The selected nodes, in node-id order. The seed is always one of them.
Sourcepub fn edges(&self) -> &[GraphEdgeId] ⓘ
pub fn edges(&self) -> &[GraphEdgeId] ⓘ
Every selected edge whose source and target are both selected, in raw edge-id order.
Sourcepub fn containment(&self) -> &[ContainmentEdge]
pub fn containment(&self) -> &[ContainmentEdge]
Every containment edge whose parent and child are both selected, in child order.
Trait Implementations§
Auto Trait Implementations§
impl Freeze for GraphSubgraph
impl RefUnwindSafe for GraphSubgraph
impl Send for GraphSubgraph
impl Sync for GraphSubgraph
impl Unpin for GraphSubgraph
impl UnsafeUnpin for GraphSubgraph
impl UnwindSafe for GraphSubgraph
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