Struct PropertyGraph 

pub struct PropertyGraph {
    pub name: String,
    pub vertex_tables: Vec<VertexTable>,
    pub edge_tables: Vec<EdgeTable>,
}

One graph, as CREATE PROPERTY GRAPH defined it: its vertex and edge tables (SQL/PGQ’s element tables), with their keys resolved (#295).

MATCH spans every table. An algorithm runs on one vertex table and one edge table, a GraphDef, as in DuckPGQ: see PropertyGraph::pair.

Fields

name: String

The graph’s name: also the name of the schema holding its nodes and edges tables (when it has one implied pair; see Self::pair).

vertex_tables: Vec<VertexTable>

edge_tables: Vec<EdgeTable>

Implementations

impl PropertyGraph

pub fn tables(&self) -> impl Iterator<Item = &TableReference>

Every table the graph reads, vertex tables first.

pub fn vertex_table(&self, label: &str) -> Option<&VertexTable>

The vertex table called (or labelled) label.

pub fn edge_table(&self, label: &str) -> Option<&EdgeTable>

The edge table called (or labelled) label.

pub fn endpoint_vertex( &self, edge: &EdgeTable, source: bool, ) -> Option<&VertexTable>

The vertex table an endpoint of edge refers to: its REFERENCES, or without one, the graph’s only vertex table (None if it has none).

pub fn pair(&self, vertex: Option<&str>, edge: Option<&str>) -> Result<GraphDef>

The pair an algorithm runs on: an edge table, and the vertex table both its endpoints refer to (if any), as DuckPGQ’s pagerank(g, vertex, edge). With no labels the pair is implied when the graph has one edge table: every graph before #295 has one.

pub fn default_pair(&self) -> Option<GraphDef>

The implied pair, when there is one: the graph’s nodes and edges tables are this pair’s.

Trait Implementations

impl Clone for PropertyGraph

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for PropertyGraph

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

Formats the value using the given formatter.

impl Eq for PropertyGraph

impl From<GraphDef> for PropertyGraph

A graph of one pair: what every graph was before #295.

fn from(def: GraphDef) -> Self

Converts to this type from the input type.

impl PartialEq for PropertyGraph

fn eq(&self, other: &Self) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for PropertyGraph