pub struct GraphSchema {
pub nodes: i64,
pub edges: i64,
pub node_labels: Vec<GraphLabelSchema>,
pub edge_types: Vec<GraphEdgeTypeSchema>,
pub unlabeled_nodes: GraphLabelSchema,
}Expand description
What a graph’s data looks like.
Fields§
§nodes: i64How many nodes the graph holds.
edges: i64How many edges the graph holds.
node_labels: Vec<GraphLabelSchema>Each node label.
edge_types: Vec<GraphEdgeTypeSchema>Each edge type.
unlabeled_nodes: GraphLabelSchemaThe nodes that carry no label.
Trait Implementations§
Source§impl Clone for GraphSchema
impl Clone for GraphSchema
Source§impl Debug for GraphSchema
impl Debug for GraphSchema
Source§impl<'de> Deserialize<'de> for GraphSchema
impl<'de> Deserialize<'de> for GraphSchema
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
impl Eq for GraphSchema
Source§impl PartialEq for GraphSchema
impl PartialEq for GraphSchema
impl StructuralPartialEq for GraphSchema
Auto Trait Implementations§
impl Freeze for GraphSchema
impl RefUnwindSafe for GraphSchema
impl Send for GraphSchema
impl Sync for GraphSchema
impl Unpin for GraphSchema
impl UnsafeUnpin for GraphSchema
impl UnwindSafe for GraphSchema
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