code: def test_fully_connected_graph_no_self_edges(self, n_node, n_graph):
      # `test_fully_connected_graph` already tests the case `add_self_edges=True`
      # so all that is left to test is that if we set `add_self_edges=False` we
      # get the same edges, except for the self-edges (although order may differ).
      graph_with_self_edges = utils.get_fully_connected_graph(
          n_node, n_graph, add_self_edges=True
      )
      graph_without_self_edges = utils.get_fully_connected_graph(
          n_node, n_graph, add_self_edges=False
      )
  
      # We will use sets to compare the order, since the order is not preserved
      # due to the usage of `np.roll` (e.g. if you remove the self edges after
      # add_self_edges=True, the remaining edges are in a different order than if
      # add_self_edges=False).
      send_recv_actual = {
          (s, r)
          for s, r in zip(
              np.asarray(graph_without_self_edges.senders),
              np.asarray(graph_without_self_edges.receivers),
          )
      }
  
      # Remove the self edges by hand from `graph_with_self_edges`
      mask_self_edges = (
          graph_with_self_edges.senders
          == graph_with_self_edges.receivers
      )
      send_recv_expected = {
          (s, r)
          for s, r in zip(
              np.asarray(
                  graph_with_self_edges.senders[~mask_self_edges]
              ),
              np.asarray(
                  graph_with_self_edges.receivers[~mask_self_edges]
              ),
          )
      }
      self.assertSetEqual(send_recv_actual, send_recv_expected)
  
imports: import functools
  import os
  from absl.testing import absltest
  from absl.testing import parameterized
  import jax
  from jax.lib import xla_bridge
  import jax.numpy
  import jax.tree_util
  from jraph._src import graph
  from jraph._src import utils
  import numpy
label_desc: Use image node_id 30 for calling the GraphTest obj's underlying member method code with example usage: obj.test_fully_connected_graph_no_self_edges(n_node, n_graph) without return types