Previous Page Next Page Contents

Network::inDegree -- the indegree of nodes

Introduction

Network::inDegree(G, v) returns the number of edges coming into the node v of the network G.

Call(s)

Network::inDegree(G <, v...>)

Parameters

G - a network
v - expression

Returns

either an integer or a table

Details

Example 1

In 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
                                 )

Changes




Do you have questions or comments?


Copyright © SciFace Software GmbH & Co. KG 2000