pub struct GraphPath {
pub source_id: String,
pub target_id: String,
pub path: Vec<String>,
pub hops: i32,
pub edges: Vec<GraphEdge>,
}Expand description
Shortest path between two memories from GET /v1/memories/{id}/path.
Fields§
§source_id: StringStarting memory ID.
target_id: StringDestination memory ID.
path: Vec<String>Ordered list of memory IDs from source to target (inclusive).
hops: i32Number of edges traversed (path.len() - 1). -1 if no path exists.
edges: Vec<GraphEdge>Edges along the path, in traversal order.
Trait Implementations§
Source§impl<'de> Deserialize<'de> for GraphPath
impl<'de> Deserialize<'de> for GraphPath
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 GraphPath
impl RefUnwindSafe for GraphPath
impl Send for GraphPath
impl Sync for GraphPath
impl Unpin for GraphPath
impl UnsafeUnpin for GraphPath
impl UnwindSafe for GraphPath
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