We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 6b0abb2 commit 8510daeCopy full SHA for 8510dae
src/staticgraph.jl
@@ -40,7 +40,7 @@ end
40
41
badj(g::StaticGraph, s) = fadj(g, s)
42
43
-ne(g::StaticGraph{T, U}) where T where U = T(length(g.f_vec) ÷ 2)
+ne(g::StaticGraph{T, U}) where T where U = U(length(g.f_vec) ÷ 2)
44
45
function has_edge(g::StaticGraph, e::StaticGraphEdge)
46
u, v = Tuple(e)
@@ -67,4 +67,4 @@ Return `true` if `g` is a directed graph.
67
"""
68
is_directed(::Type{StaticGraph}) = false
69
is_directed(::Type{StaticGraph{T, U}}) where T where U = false
70
-is_directed(g::StaticGraph) = false
+is_directed(g::StaticGraph) = false
0 commit comments