degree {igraph} | R Documentation |
Degree and degree distribution of the vertices
Description
The degree of a vertex is its most basic structural property, the number of its adjacent edges.
Usage
degree(
graph,
v = V(graph),
mode = c("all", "out", "in", "total"),
loops = TRUE,
normalized = FALSE
)
max_degree(
graph,
...,
v = V(graph),
mode = c("all", "out", "in", "total"),
loops = TRUE
)
degree_distribution(graph, cumulative = FALSE, ...)
Arguments
graph |
The graph to analyze. |
v |
The ids of vertices of which the degree will be calculated. |
mode |
Character string, “out” for out-degree, “in” for in-degree or “total” for the sum of the two. For undirected graphs this argument is ignored. “all” is a synonym of “total”. |
loops |
Logical; whether the loop edges are also counted. |
normalized |
Logical scalar, whether to normalize the degree. If
|
... |
These dots are for future extensions and must be empty. |
cumulative |
Logical; whether the cumulative degree distribution is to be calculated. |
Value
For degree()
a numeric vector of the same length as argument
v
.
For degree_distribution()
a numeric vector of the same length as the
maximum degree plus one. The first element is the relative frequency zero
degree vertices, the second vertices with degree one, etc.
For max_degree()
, the largest degree in the graph. When no vertices are
selected, or when the input is the null graph, zero is returned as this
is the smallest possible degree.
Related documentation in the C library
Author(s)
Gabor Csardi csardi.gabor@gmail.com
See Also
Other structural.properties:
bfs()
,
component_distribution()
,
connect()
,
constraint()
,
coreness()
,
dfs()
,
distance_table()
,
edge_density()
,
feedback_arc_set()
,
girth()
,
is_acyclic()
,
is_dag()
,
is_matching()
,
k_shortest_paths()
,
knn()
,
reciprocity()
,
subcomponent()
,
subgraph()
,
topo_sort()
,
transitivity()
,
unfold_tree()
,
which_multiple()
,
which_mutual()
Examples
g <- make_ring(10)
degree(g)
g2 <- sample_gnp(1000, 10 / 1000)
max_degree(g2)
degree_distribution(g2)