cyclomaticComplexityGr :: DynGraph gr => gr a b -> Int
cyclomaticComplexityGr gd = e - n + 2*p
    where
      p = length $ componentsOf gd
      n = noNodes gd
      e = length $ labEdges gd
cyclomaticComplexityGr :: DynGraph gr => gr a b -> Int
cyclomaticComplexityGr gd = e - n + 2*p
    where
      p = length $ componentsOf gd
      n = noNodes gd
      e = length $ labEdges gd
cyclomaticComplexityGr gd = e - n + 2*p
    where
      p = length $ componentsOf gd
      n = noNodes gd
      e = length $ labEdges gd