The *outdegree* of a node of a directed network is the number of =
edges outgoing from the node. The algorithm determines the outdegree of all=
nodes (outdegree sequence), which will be listed in the output file.

The network to analyze must be directed, otherwise there are no special = constraints.

=20Basic analysis tool, not particular for special disciplines or problems.=

=20The algorithm requires only one input, the file where the edges of the n= etwork are listed. A first read-in of the inputfile will set the values of = the number of nodes and edges of the network. In the second read-in the out= degrees of all nodes will be calculated. The program runs in a time O(m), m= being the number of edges of the network.

=20- =20
- Source Code =20

The algorithm was implemented and documented by S. Fortunato, integrated= by S. Fortunato and W. Huang.

=20Bollobas, B. (2002) Modern Graph Theory. Springer Verlag, New York.

= =20Albert, R., and Barabasi, A.-L. (2002) Statistical mechanics of complex networks. Review of Modern Phys= ics 74:47-97.

=20Newman, M.E.J. (2003) Th= e structure and function of complex networks. SIAM Review 45:167-256.=20

Pastor-Satorras, R., Vespignani, A. (2004) Evolution and Structure of th= e Internet. Cambridge University Press.

=20Boccaletti, S., Latora, V., Moreno, Y.,Chavez, M., Hwang, D.-U. (2006) <= a href=3D"http://www.ct.infn.it/%7Elatora/report_06.pdf" class=3D"external-= link" rel=3D"nofollow">Complex networks: Structure and dynamics. Physic= s Reports 424: 175-308.

=20
The license could not be verified: License Certificate has expired!=20
Generate a Free license now.