def check_completeness(graph):
    """
    Examines *graph* for completeness.

    Args:
        graph (networkx.Graph): The graph to be examined

    Returns:
        is_complete (bool): Completeness of the graph
    """

    graph_nodes = len(graph.nodes())
    graph_edges = len(graph.edges())

    # A graph K_n is complete if the number of edges in K = n(n − 1)/2
    required_edges = graph_nodes * (graph_nodes - 1) / 2

    return graph_edges == required_edges