mirror of https://github.com/KatolaZ/NetBunch
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
45 lines
799 B
45 lines
799 B
deg_seq(1) -- Compute the degree sequence of a graph
|
|
======
|
|
|
|
## SYNOPSIS
|
|
|
|
`deg_seq` <graph_in>
|
|
|
|
## DESCRIPTION
|
|
|
|
`deg_seq` computes the degree sequence of <graph_in>.
|
|
|
|
|
|
## PARAMETERS
|
|
|
|
* <graph_in>:
|
|
undirected input graph (edge list). If is equal to `-` (dash), read
|
|
the edge list from STDIN.
|
|
|
|
## OUTPUT
|
|
|
|
The program prints on STDOUT the degree sequence of <graph_in> in the
|
|
format:
|
|
|
|
k_1
|
|
k_2
|
|
k_3
|
|
....
|
|
|
|
where `k_i` is the degree of the i-th node.
|
|
|
|
## SEE ALSO
|
|
|
|
deg_seq_w(1), conf_model_deg(1), fitmle(1), power_law(1)
|
|
|
|
|
|
## REFERENCES
|
|
|
|
* V\. Latora, V. Nicosia, G. Russo, "Complex Networks: Principles,
|
|
Methods and Applications", Chapter 10, Cambridge University Press
|
|
(2017)
|
|
|
|
|
|
## AUTHORS
|
|
|
|
(c) Vincenzo 'KatolaZ' Nicosia 2009-2017 `<v.nicosia@qmul.ac.uk>`.
|
|
|