Vertices Schema
Each row represents a vertex of the graph. If the table has duplicate vertices, the function uses the first one and ignores its duplicates.
Column | Data Type | Description |
---|---|---|
vertex_key_column | INTEGER | [Column appears once for each specified vertex_key_column.] All or part of unique vertex key. Cannot be NULL. |
accumulate_column | Any | [Column appears once for each specified accumulate_column.] Column to copy to output table. |
Edges Schema
Each row represents an edge of the graph.
The data-checking rules for the Edges table are, given nodes A and B:
- No graph can have multiple A→B edges.
- An undirected graph cannot have edges A→B and B→A.
Column | Data Type | Description |
---|---|---|
source_vertex_key_column | INTEGER | Column appears once for each specified source_vertex_key_column.] All or part of key that identifies source vertex of edge. Must be a vertex_key_column in Vertices table. Cannot be NULL. |
target_vertex_key_column | INTEGER | Column appears once for each specified target_vertex_key_column.] All or part of key that identifies target vertex of edge. Must be a vertex_key_column in Vertices table. Cannot be NULL. |
edge_weight | DOUBLE PRECISION | [Required only for weighted graph.] Edge weight. Function uses only positive edge weights. Sum of edge weights that function uses must be 1. |