class_docstr: Represents a graph suitable for further processing with the graphcut package.
  
  The graph contains nodes, edges (directed) between the nodes (n-edges), edges
  between two terminals (called source and sink) and the nodes (t-edges), and a
  weight for each edge. 
  
  Notes
  -----
  The node-ids used by the graph are assumed to start with 1 and be
  continuous. This is not actually checked, except when calling the
  inconsistent() method, so be careful.
docstr: Perform some consistency tests on the graph represented by this object
  
  Returns
  -------
  consistent : bool or list
      False if consistent, else a list of inconsistency messages.
  
  Notes
  -----
  This check is very time intensive and should not be executed on huge
  graphs, except for debugging purposes.
docstr_tok: ["Perform","some","consistency","tests","on","the","graph","represented","by","this","object","Returns","--","--","--","-","consistent",":","bool","or","list","False","if","consistent",",","else","a","list","of","inconsistency","messages",".","Notes","--","--","-","This","check","is","very","time","intensive","and","should","not","be","executed","on","huge","graphs",",","except","for","debugging","purposes","."]
code: def inconsistent(self):
      r"""
      Perform some consistency tests on the graph represented by this object
  
      Returns
      -------
      consistent : bool or list
          False if consistent, else a list of inconsistency messages.
  
      Notes
      -----
      This check is very time intensive and should not be executed on huge
      graphs, except for debugging purposes.
      """
      messages = []
      for node in list(self.__tweights.keys()):
          if not node <= self.__nodes:
              messages.append(
                  "Node {} in t-weights but not in nodes.".format(node)
              )
      for node in self.__snodes:
          if not node <= self.__nodes:
              messages.append(
                  "Node {} in s-nodes but not in nodes.".format(node)
              )
      for node in self.__tnodes:
          if not node <= self.__nodes:
              messages.append(
                  "Node {} in t-nodes but not in nodes.".format(node)
              )
      for e in list(self.__nweights.keys()):
          if not e[0] <= self.__nodes:
              messages.append(
                  "Node {} in edge {} but not in nodes.".format(e[0], e)
              )
          if not e[1] <= self.__nodes:
              messages.append(
                  "Node {} in edge {} but not in nodes.".format(e[1], e)
              )
          if (e[1], e[0]) in iter(list(self.__nweights.keys())):
              messages.append(
                  "The reversed edges of {} is also in the n-weights.".format(
                      e
                  )
              )
  
      if 0 == len(messages):
          return False
      else:
          return messages
  
imports: from .maxflow import GraphDouble, GraphFloat
label_desc: Use image node_id 14 for calling the Graph obj's underlying member method code with example usage: obj.inconsistent() and returns: False, messages