(n, create_using=None)
| 142 | @nodes_or_number(0) |
| 143 | @patch_docstring(nxa.complete_graph) |
| 144 | def complete_graph(n, create_using=None): |
| 145 | n_name, nodes = n |
| 146 | G = empty_graph(n_name, create_using) |
| 147 | if len(nodes) > 1: |
| 148 | if G.is_directed(): |
| 149 | edges = itertools.permutations(nodes, 2) |
| 150 | else: |
| 151 | edges = itertools.combinations(nodes, 2) |
| 152 | G.add_edges_from(edges) |
| 153 | return G |
| 154 | |
| 155 | |
| 156 | @patch_docstring(nxa.circular_ladder_graph) |
no test coverage detected