math.polygonal_graph

Complexity

Total Complexity

3

Size/Duplication

Total Lines	55
Duplicated Lines	0 %

Importance

Changes

0

2 Functions

Rating	Name	Duplication	Size	Complexity
A	polygonal_graph_model()	0	21	1
A	polygonal_graph_edges()	0	4	2

import networkx as nx

import graphinate

# import graphinate.modeling
from graphinate import GraphModel


def polygonal_graph_edges(edges_count: int):
    for i in range(1, edges_count):
        yield {'source': i, 'target': i + 1}
    yield {'source': edges_count, 'target': 1}


def polygonal_graph_model(name: str, number_of_sides: int) -> graphinate.GraphModel:
    """
    Create a polygonal graph model.

    Args:
        name (str): The Graph's name.
        number_of_sides (int): Number of sides in the polygon.

    Returns:
        GraphModel: A graph model representing a polygonal graph.
    """

    # Define GraphModel
    graph_model: GraphModel = graphinate.model(name)

    # Register edges supplier function
    @graph_model.edge()
    def edge():
        yield from polygonal_graph_edges(number_of_sides)

    return graph_model


model = polygonal_graph_model("Octagonal Graph", 8)

if __name__ == '__main__':
    # 1. Define Graph Builder
    builder = graphinate.builders.NetworkxBuilder(model=model)

    # Then
    # 2. Build the Graph object
    graph: nx.Graph = builder.build()

    # Then
    # 3. Option A - Output to console
    print(graph)

    # Or
    # 3. Option B - Output as a plot
    graphinate.materializers.plot(graph)