[docs]defis_coupling_map_complete(coupling_map:CouplingMap)->bool:"""A complete digraph is a digraph in which there is a directed edge from every vertex to every other vertex."""distance_matrix=coupling_map.distance_matrixassertdistance_matrixisnotNoneis_semicomplete=all(distancein[1,0]fordistanceindistance_matrix.flatten())returnis_semicompleteandcoupling_map.is_symmetric