Barbell Graph

the barbell graph is two complete graphs connected by a bridge path

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 both complete graphs
- n - number of vertices in the bridge 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/Barbell_graph

No implementation file or test is named. Start by locating the existing graph-creation entry points and related tests, then clarify the mismatch between the Barbell Graph title and the ag_create_tadpole_graph syntax. Done means the requested API creates two complete graphs joined by a bridge path with the documented parameters and behavior.

Written by the indexing model from the issue text.