(self, H, G)
| 36 | self.K3.add_edges_from(self.k3edges) |
| 37 | |
| 38 | def graphs_equal(self, H, G): |
| 39 | assert G._adj == H._adj |
| 40 | assert G._node == H._node |
| 41 | assert G.graph == H.graph |
| 42 | assert G.name == H.name |
| 43 | if G.is_directed() and H.is_directed(): |
| 44 | assert G._pred == H._pred |
| 45 | assert G._succ == H._succ |
| 46 | |
| 47 | def shallow_copy_node_attr(self, H, G): |
| 48 | assert G.nodes[0]["foo"] == H.nodes[0]["foo"] |
no test coverage detected