Struct NodeData 

pub struct NodeData {
    pub id: VertexId,
    pub properties: HashId,
    pub incoming: BTreeSet<HashId>,
    pub outgoing: BTreeSet<HashId>,
}

Fields

id: VertexId

Unique identifier of the node in the graph.

properties: HashId

The key of the dataset that represents the properties of the node.

incoming: BTreeSet<HashId>

A set of hashes representing incoming connections (edges) to this node.

outgoing: BTreeSet<HashId>

A set of hashes representing outgoing connections (edges) from this node.

Trait Implementations

impl Debug for NodeData

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for NodeData

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<P, K, E> PropertyGraphReader<Uuid, NodeData, String, EdgeData, String, P, Error<E>> for KvGraphStore<P, K, E>

where P: Property<HashId, SerialisationError>, K: KVStore<E>, E: Send,

fn nodes( &self, filter: PropertyFilter<HashId>, ) -> Result<impl Iterator<Item = VertexId>, Error<E>>

List nodes

fn edges( &self, filter: PropertyFilter<HashId>, ) -> Result<impl Iterator<Item = HashId>, Error<E>>

List edges

fn properties( &self, filter: PropertyFilter<HashId>, ) -> Result<impl Iterator<Item = HashId>, Error<E>>

List properties

fn read_node(&self, id: VertexId) -> Result<NodeData, Error<E>>

Get a node by its key

fn read_edge(&self, id: &HashId) -> Result<EdgeData, Error<E>>

Get an edge by its key

fn read_property(&self, id: &HashId) -> Result<P, Error<E>>

Get a property by its key

impl Serialize for NodeData

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.