Network::inDegree -- the
indegree of nodes
Introduction returns the number
of edges coming into the node Network::inDegree(G, v)v of the network
G.
Call(s)Network::inDegree(G <, v...>)
ParametersG |
- | a network |
v |
- | expression |
Returnseither an integer or a table
DetailsNetwork::inDegree(G, v) returns the
indegree of the node v in network G, i.e.,
the number of edges [w,v].Network::inDegree(G, v1, v2, ...) returns
a table in which the keys are v1, v2, ... and the
corresponding values are the indegrees, i.e.,
Network::inDegree(G, v1, v2)[v1] =
Network::inDegree(G, v1).Network::inDegree(G) returns a table in
which each node of G is mapped to its indegree. If
G contains more than one vertex,
Network::inDegree(G) is equivalent to
Network::inDegree(G,
op(Network::vertex(G))).
Example
1In a complete network of n nodes, each vertex has indegree n-1:
>> N1 := Network::complete(3): Network::inDegree(N1)
table(
3 = 2,
2 = 2,
1 = 2
)
Network::InDegree