class_docstr: Tests for graph colouring functions.
docstr: Tests validity of graph colouring solution for a graph with no edges.
docstr_tok: ["Tests","validity","of","graph","colouring","solution","for","a","graph","with","no","edges","."]
code: def test_trivial_graph_colouring(self, n_terms):
      """Tests validity of graph colouring solution for a graph with no edges."""
  
      adjacency_matrix = np.zeros((n_terms, n_terms))
  
      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 3 for calling the TestGraphcolouringFunctions obj's underlying member method code with example usage: obj.test_trivial_graph_colouring(n_terms) without return types