class_docstr: Tests for graph colouring functions.
docstr: Verifies if all vertices of the same colour are not connected.
docstr_tok: ["Verifies","if","all","vertices","of","the","same","colour","are","not","connected","."]
code: def verify_graph_colour_solution(self, adjacency_matrix, colouring):
      """Verifies if all vertices of the same colour are not connected."""
  
      for colour in colouring.keys():
          grouping = colouring[colour]
          size_grouping = len(grouping)
  
          for i in range(size_grouping):
              for j in range(i + 1, size_grouping):
                  vert_i = grouping[i][0]
                  vert_j = grouping[j][0]
  
                  if adjacency_matrix[vert_i][vert_j] == 1:
                      return False
  
      return True
  
imports: import pytest
  import numpy
  from pennylane.pauli.grouping.graph_colouring import largest_first, recursive_largest_first
label_desc: Use image node_id 1 for calling the TestGraphcolouringFunctions obj's underlying member method code with example usage: obj.verify_graph_colour_solution(adjacency_matrix, colouring) and returns: True, False