JoshInnis opened a new issue, #271:
URL: https://github.com/apache/age/issues/271
A complete graph on n nodes means that all pairs of distinct nodes have an
edge connecting them.
Syntax:
```
ag_catalog.age_create_complete_graph(graph_name Name, Nodes int,
vertex_label_name Name DEFAULT = NULL,
vertex_properties agtype DEFAULT = NULL,
edge_label_name Name DEAULT = NULL,
edge_properties agtype DEFAULT = NULL,
bidirectional bool DEFAULT = TRUE);
```
Input:
- graph_name - Graph Name
- nodes - Number of Nodes
- vertex_label_name - Name of the label to assign each vertex to.
- vertex_properties - Property values to assign each vertex. Default is NULL
- edge_label_name - Name of the label to assign each edge to.
- edge_properties - Property values to assign each edge. Default is NULL
- bidirectional - Bidirectional True or False. Default True.
Returns Void
https://en.wikipedia.org/wiki/Complete_graph
--
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.
To unsubscribe, e-mail: [email protected]
For queries about this service, please contact Infrastructure at:
[email protected]
