Enum Request 

pub enum Request {
    CreateNode {
        labels: Vec<String>,
        properties: Value,
        embedding: Option<Vec<f32>>,
    },
    CreateEdge {
        source: u64,
        target: u64,
        edge_type: String,
        properties: Value,
        weight: f64,
        valid_from: Option<i64>,
        valid_to: Option<i64>,
    },
    GetNode {
        id: u64,
    },
    GetEdge {
        id: u64,
    },
    UpdateNode {
        id: u64,
        properties: Value,
    },
    UpdateEdge {
        id: u64,
        properties: Value,
    },
    DeleteNode {
        id: u64,
    },
    DeleteEdge {
        id: u64,
    },
    Neighbors {
        id: u64,
        direction: String,
        edge_type: Option<String>,
    },
    Bfs {
        start: u64,
        max_depth: usize,
    },
    ShortestPath {
        from: u64,
        to: u64,
        weighted: bool,
    },
    VectorSearch {
        query: Vec<f32>,
        k: usize,
    },
    HybridSearch {
        anchor: u64,
        query: Vec<f32>,
        max_hops: usize,
        k: usize,
        alpha: f32,
    },
    SemanticNeighbors {
        id: u64,
        concept: Vec<f32>,
        direction: String,
        k: usize,
    },
    SemanticWalk {
        start: u64,
        concept: Vec<f32>,
        max_hops: usize,
    },
    Query {
        gql: String,
    },
    ExtractSubgraph {
        center: u64,
        hops: usize,
        max_nodes: usize,
        format: String,
    },
    GraphRag {
        question: String,
        question_embedding: Option<Vec<f32>>,
        anchor: Option<u64>,
        hops: usize,
        max_nodes: usize,
        format: String,
    },
    NeighborsAt {
        id: u64,
        direction: String,
        timestamp: i64,
        edge_type: Option<String>,
    },
    BfsAt {
        start: u64,
        max_depth: usize,
        timestamp: i64,
    },
    ShortestPathAt {
        from: u64,
        to: u64,
        timestamp: i64,
        weighted: bool,
    },
    Dfs {
        start: u64,
        max_depth: usize,
    },
    DfsAt {
        start: u64,
        max_depth: usize,
        timestamp: i64,
    },
    FindByLabel {
        label: String,
    },
    DeleteByLabel {
        label: String,
    },
    FindEdgeByType {
        edge_type: String,
    },
    RunPageRank {
        nodes: Option<Vec<u64>>,
        damping: f64,
        max_iterations: usize,
        tolerance: f64,
    },
    RunLouvain {
        nodes: Option<Vec<u64>>,
    },
    RunConnectedComponents {
        nodes: Option<Vec<u64>>,
        strong: bool,
    },
    RunDegreeCentrality {
        nodes: Option<Vec<u64>>,
        direction: String,
    },
    RunBetweennessCentrality {
        nodes: Option<Vec<u64>>,
    },
    GraphStats,
    GetSubgraph {
        center: u64,
        hops: usize,
        max_nodes: usize,
    },
    Ping,
}

Client request sent over the wire.

Variants

CreateNode

Create a new node.

Fields

labels: Vec<String>

properties: Value

embedding: Option<Vec<f32>>

CreateEdge

Create a new edge between two nodes.

Fields

source: u64

target: u64

edge_type: String

properties: Value

weight: f64

valid_from: Option<i64>

Optional temporal validity start (epoch milliseconds, inclusive).

valid_to: Option<i64>

Optional temporal validity end (epoch milliseconds, exclusive).

GetNode

Get a node by ID.

Fields

id: u64

GetEdge

Get an edge by ID.

Fields

id: u64

UpdateNode

Update a node’s properties.

Fields

id: u64

properties: Value

UpdateEdge

Update an edge’s properties.

Fields

id: u64

properties: Value

DeleteNode

Delete a node (and its edges).

Fields

id: u64

DeleteEdge

Delete an edge.

Fields

id: u64

Neighbors

Get neighbors of a node.

Fields

id: u64

direction: String

edge_type: Option<String>

Bfs

Run a BFS traversal.

Fields

start: u64

max_depth: usize

ShortestPath

Find shortest path between two nodes.

Fields

from: u64

to: u64

weighted: bool

VectorSearch

Vector similarity search.

Fields

query: Vec<f32>

k: usize

HybridSearch

Hybrid search combining graph proximity and vector similarity.

Fields

anchor: u64

query: Vec<f32>

max_hops: usize

k: usize

alpha: f32

SemanticNeighbors

Rank neighbors by semantic similarity to a concept embedding.

Fields

id: u64

concept: Vec<f32>

direction: String

k: usize

SemanticWalk

Greedy multi-hop walk toward a semantic concept.

Fields

start: u64

concept: Vec<f32>

max_hops: usize

Query

Execute a GQL query string.

Fields

gql: String

ExtractSubgraph

Extract a subgraph around a node and linearize it.

Fields

center: u64

hops: usize

max_nodes: usize

format: String

GraphRag

Execute a GraphRAG query (requires LLM provider configuration).

Fields

question: String

question_embedding: Option<Vec<f32>>

anchor: Option<u64>

hops: usize

max_nodes: usize

format: String

NeighborsAt

Get neighbors of a node at a specific point in time.

Fields

id: u64

direction: String

timestamp: i64

edge_type: Option<String>

BfsAt

Run a BFS traversal at a specific point in time.

Fields

start: u64

max_depth: usize

timestamp: i64

ShortestPathAt

Find shortest path at a specific point in time.

Fields

from: u64

to: u64

timestamp: i64

weighted: bool

Dfs

Depth-first search traversal.

Fields

start: u64

max_depth: usize

DfsAt

Depth-first search traversal at a specific point in time.

Fields

start: u64

max_depth: usize

timestamp: i64

FindByLabel

Find nodes by label.

Fields

label: String

DeleteByLabel

Delete every node carrying the given label (and all its edges). Returns {"deleted": N}. astraeadb-issues.md #4.

Fields

label: String

FindEdgeByType

Find all edges whose edge_type matches the given string. Returns {"edges": [{"edge_id": N, "source": N, "target": N}, ...]}. astraeadb-issues.md #3.

Fields

edge_type: String

RunPageRank

Run PageRank algorithm.

Fields

nodes: Option<Vec<u64>>

damping: f64

max_iterations: usize

tolerance: f64

RunLouvain

Run Louvain community detection.

Fields

nodes: Option<Vec<u64>>

RunConnectedComponents

Run connected components detection.

Fields

nodes: Option<Vec<u64>>

strong: bool

RunDegreeCentrality

Run degree centrality.

Fields

nodes: Option<Vec<u64>>

direction: String

RunBetweennessCentrality

Run betweenness centrality.

Fields

nodes: Option<Vec<u64>>

GraphStats

Get graph statistics.

GetSubgraph

Get raw subgraph (nodes + edges) for visualization.

Fields

center: u64

hops: usize

max_nodes: usize

Ping

Server status / health check.

Trait Implementations

impl Clone for Request

fn clone(&self) -> Request

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for Request

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for Request

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for Request

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

where __S: Serializer,

Serialize this value into the given Serde serializer.