Reach 100% coverage (#60)

Author: gdalle

src/graph.jl

@@ -25,9 +25,6 @@ vertices(g::Graph) = 1:length(g)
 neighbors(g::Graph, v::Integer) = view(g.rowval, g.colptr[v]:(g.colptr[v + 1] - 1))
 degree(g::Graph, v::Integer) = length(g.colptr[v]:(g.colptr[v + 1] - 1))
 
-maximum_degree(g::Graph) = maximum(Base.Fix1(degree, g), vertices(g))
-minimum_degree(g::Graph) = minimum(Base.Fix1(degree, g), vertices(g))
-
 ## Bipartite graph
 
 """