class_docstr: Tests for graph colouring functions.
docstr: Verify that random unweighted undirected graph's colour is a valid solution.
docstr_tok: ["Verify","that","random","unweighted","undirected","graph","'s","colour","is","a","valid","solution","."]
code: def test_graph_colouring(self, adjacency_matrix):
      """Verify that random unweighted undirected graph's colour is a valid solution."""
  
      n_terms = np.shape(adjacency_matrix)[0]
  
      for i in range(n_terms):
          for j in range(i + 1, n_terms):
              adjacency_matrix[j, i] = adjacency_matrix[i, j]
  
      dummy_terms = np.reshape(list(range(n_terms)), (n_terms, 1))
      lf_colouring = largest_first(dummy_terms, adjacency_matrix)
      rlf_colouring = recursive_largest_first(
          dummy_terms, adjacency_matrix
      )
  
      assert self.verify_graph_colour_solution(
          adjacency_matrix, lf_colouring
      )
      assert self.verify_graph_colour_solution(
          adjacency_matrix, rlf_colouring
      )
  
imports: import pytest
  import numpy
  from pennylane.pauli.grouping.graph_colouring import largest_first, recursive_largest_first
label_desc: Use image node_id 2 for calling the TestGraphcolouringFunctions obj's underlying member method code with example usage: obj.test_graph_colouring(adjacency_matrix) without return types