Tadpole Graph

[JoshInnis]

the tadpole graph is a special type of graph consisting of a cycle graph on m (at least 3) vertices and a path graph on n vertices, connected with a bridge.

Syntax:

ag_catalog.age_create_tadpole_graph(graph_name Name,
                                    m int,
                                    n 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 - Name of the graph to be created
• m - number of vertices in the cycle
• n - number of vertices in the path.
• 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/Tadpole_graph

[Amr-Shams]

I am intern and I would love to choose this project as my project #1