Combinatorics: fixed degree(::Graph) docu

oscar-system · Jan 10, 2025 · 658ea33 · 658ea33
1 parent 43499a7
commit 658ea33
Showing 1 changed file with 3 additions and 2 deletions.
diff --git a/src/Combinatorics/Graphs/functions.jl b/src/Combinatorics/Graphs/functions.jl
@@ -511,8 +511,9 @@ end
 @doc raw"""
     degree(g::Graph{T} [, v::Int64]) where {T <: Union{Directed, Undirected}}
 
-Return the degree of the vertex `v` in the graph `g`.
-If `v` is missing, return the list of degrees of all vertices.
+Return the degree of the vertex `v` in the graph `g`. If `v` is
+missing, return the list of degrees of all vertices. If the graph is
+directed, only neighbors reachable via outgoing edges are counted.
 
 # Examples
 ```jldoctest