## `Network::outDegree` -- returns the out-degrees for nodes

#### Introduction

`Network::outDegree` `G` returns the ``out-degrees'' for the nodes of the network `G`. An out-degree is the number of edges leaving the node.

#### Call(s)

`Network::outDegree(G <, v...>)`

#### Parameters

`G` | - | a `Network`
`v` | - | expression

#### Returns

Depending on the number of arguments, either a table or a non-negative integer.

#### Details

- `Network::outDegree` returns the out-degree of one or several nodes of a network, i.e. the number of leaving edges.
- With `outDegree(G,v)`, where `G` is a network and `v` is a node in `G`, the out-degree of `v` is returned, i.e. the number of edges that are starting in `v`.
- `outDegree(G, v1, v2, ...)`, where `v1, v2, ...` are nodes in `G`, a table `ll` is returned, where `ll[i]` is the out-degree of node `l[i]` in `G`.
- `OutDegree(G)` gives a table `lg` with the out-degree of all nodes of `G`, i.e. `lg[i]` is the out-degree of node `Vertex(G)[i]` in `G`.

#### Example 1

In a complete network with n vertices, each vertex has out-degree n-1.

    >> N1 := Network::complete(4):
       Network::outDegree(N1)

                                     table(
                                       4 = 3,
                                       3 = 3,
                                       2 = 3,
                                       1 = 3
                                     )

#### Changes

- used to be called `Network::OutDegree`

Do you have questions or comments?
Copyright © SciFace Software GmbH & Co. KG 2000