Enum GraphCommand 

pub enum GraphCommand {
    Neighborhood {
        source: String,
        depth: u32,
        direction: String,
        edge_labels: Option<Vec<String>>,
    },
    ShortestPath {
        source: String,
        target: String,
        algorithm: String,
        direction: String,
        limit: Option<u32>,
        order_by: Option<GraphCommandOrderBy>,
    },
    Traverse {
        source: String,
        strategy: String,
        depth: u32,
        direction: String,
        edge_labels: Option<Vec<String>>,
    },
    Centrality {
        algorithm: String,
        limit: Option<u32>,
        order_by: Option<GraphCommandOrderBy>,
    },
    Community {
        algorithm: String,
        max_iterations: u32,
        limit: Option<u32>,
        order_by: Option<GraphCommandOrderBy>,
    },
    Components {
        mode: String,
        limit: Option<u32>,
        order_by: Option<GraphCommandOrderBy>,
    },
    Cycles {
        max_length: u32,
    },
    Clustering,
    TopologicalSort,
    Properties {
        source: Option<String>,
    },
}

Variants

Neighborhood

GRAPH NEIGHBORHOOD ‘source’ [DEPTH n] [DIRECTION dir] [EDGES IN (‘label’, …)]

Fields

source: String

depth: u32

direction: String

edge_labels: Option<Vec<String>>

ShortestPath

GRAPH SHORTEST_PATH ‘source’ TO ‘target’ [ALGORITHM alg] [DIRECTION dir] [ORDER BY metric [ASC|DESC]] [LIMIT n]

Fields

source: String

target: String

algorithm: String

direction: String

limit: Option<u32>

order_by: Option<GraphCommandOrderBy>

Traverse

GRAPH TRAVERSE ‘source’ [STRATEGY bfs|dfs] [DEPTH n] [DIRECTION dir] [EDGES IN (‘label’, …)]

Fields

source: String

strategy: String

depth: u32

direction: String

edge_labels: Option<Vec<String>>

Centrality

GRAPH CENTRALITY [ALGORITHM alg] [ORDER BY metric [ASC|DESC]] [LIMIT n]

limit = None keeps the historical implicit top-100 cap. Some(n) caps the returned rows at n.

Fields

algorithm: String

limit: Option<u32>

order_by: Option<GraphCommandOrderBy>

Community

GRAPH COMMUNITY [ALGORITHM alg] [MAX_ITERATIONS n] [ORDER BY metric [ASC|DESC]] [LIMIT n]

Fields

algorithm: String

max_iterations: u32

limit: Option<u32>

order_by: Option<GraphCommandOrderBy>

Components

GRAPH COMPONENTS [MODE connected|weak|strong] [ORDER BY metric [ASC|DESC]] [LIMIT n]

Fields

mode: String

limit: Option<u32>

order_by: Option<GraphCommandOrderBy>

Cycles

GRAPH CYCLES [MAX_LENGTH n]

Fields

max_length: u32

Clustering

GRAPH CLUSTERING

TopologicalSort

GRAPH TOPOLOGICAL_SORT

Properties

GRAPH PROPERTIES [‘’]

source = None returns graph-wide stats. source = Some("...") returns the full property bag of a specific node, resolved via the same label index as GRAPH NEIGHBORHOOD / GRAPH TRAVERSE (issue #416).

Fields

source: Option<String>

Trait Implementations

impl Clone for GraphCommand

fn clone(&self) -> GraphCommand

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for GraphCommand

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

Formats the value using the given formatter.