Erdős–Rényi Graph
- Dominant language
- C
- Stars
- 4.8k
- Forks
- 523
- Avg merge
- 1d 2h
- Merged PRs (30d)
- 9
Description
The Erdős–Rényi model is a random graph generation model that produces graphs where each edge has a fixed probability of being present or absent, independently of the other edges.
Syntax:
```
ag_catalog.age_create_erdos_renyo_graph(graph_name Name, n int, p float
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 - Name of the graph to be created
- n - The number of nodes
- p -The probability of each edge existing
- 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.
https://en.wikipedia.org/wiki/Erd%C5%91s%E2%80%93R%C3%A9nyi_model
Contributor guide
Assessment
This issue has not been assessed yet.