Skip to content

add max and min out- and in-degree #11

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Oct 7, 2025
Merged

add max and min out- and in-degree #11

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 4 additions & 0 deletions src/GraphProperties.jl
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -56,6 +56,10 @@ let
(:NumberOfConnectedComponents, "The *number of connected components* of an undirected graph."),
(:MinimumDegree, "The *minimum degree* among the degrees of the vertices of an undirected graph."),
(:MaximumDegree, "The *maximum degree* among the degrees of the vertices of an undirected graph."),
(:MinimumIndegree, "The *minimum indegree* among the indegrees of the vertices of a directed graph."),
(:MaximumIndegree, "The *maximum indegree* among the indegrees of the vertices of a directed graph."),
(:MinimumOutdegree, "The *minimum outdegree* among the outdegrees of the vertices of a directed graph."),
(:MaximumOutdegree, "The *maximum outdegree* among the outdegrees of the vertices of a directed graph."),
(:Girth, "The *girth* of a undirected graph: the length of its shortest cycle."),
(:VertexConnectivity, "The *vertex-connectivity* of an undirected graph. Also known as the *connectivity*."),
(:EdgeConnectivity, "The *edge-connectivity* of an undirected graph."),
Expand Down