class_docstr: Basic topological (non-weighted) directed Graph class
  
  Member variables:
  
  * V (int > 0): the number of vertices
  * E (int >= 0): the number of edges
  
  Properties:
  
  * vertices (list, type=int, shape=(V,))  vertices id
  * edges (list, type=int, shape=(E,2)): edges as vertices id tuples
class_docstr_tok: ["Basic","topological","(","non-weighted",")","directed","Graph","class","Member","variables",":","*","V","(","int",">","0",")",":","the","number","of","vertices","*","E","(","int",">","=","0",")",":","the","number","of","edges","Properties",":","*","vertices","(","list",",","type=int",",","shape=","(","V",",",")",")","vertices","id","*","edges","(","list",",","type=int",",","shape=","(","E,2",")",")",":","edges","as","vertices","id","tuples"]
docstr: Compte the different connected components of the graph.
  
  Returns
  -------
  label: array of shape(self.V), labelling of the vertices
docstr_tok: ["Compte","the","different","connected","components","of","the","graph",".","Returns","--","--","--","-","label",":","array","of","shape","(","self.V",")",",","labelling","of","the","vertices"]
code: def cc(self):
      """Compte the different connected components of the graph.
  
      Returns
      -------
      label: array of shape(self.V), labelling of the vertices
      """
      try:
          from scipy.sparse import cs_graph_components
  
          _, label = cs_graph_components(self.adjacency())
      except:
          pass
      lil = self.to_coo_matrix().tolil().rows.tolist()
      label = lil_cc(lil)
      return label
  
imports: import numpy
  from scipy.sparse import coo_matrix
label_desc: Use image node_id 10 for calling the Graph obj's underlying member method code with example usage: obj.cc() and returns: label