Previous Page Next Page Contents

Network::complete -- generates a complete network

Introduction

Network::complete(n) generates the complete network with n vertices.

Call(s)

Network::complete(n)

Parameters

n - non negative integer

Returns

a network

Details

Example 1

The complete network with three vertices has 3!=6 edges.

>> N1 := Network::complete(3):
   Network::printGraph(N1)
                            Vertices: [1, 2, 3]
      
          Edges: [[1, 2], [1, 3], [2, 1], [2, 3], [3, 1], [3, 2]]
      
                    Vertex weights: table(3=0,2=0,1=0)
      
      Edge capacities: table([3, 2]=1,[3, 1]=1,[2, 3]=1,[2, 1]=1,[1,\
       3]=1,[1, 2]=1)
      
      Edge weights: table([3, 2]=1,[3, 1]=1,[2, 3]=1,[2, 1]=1,[1, 3]\
      =1,[1, 2]=1)
      
          Adjacency list (out): table(3=[1, 2],2=[1, 3],1=[2, 3])
      
          Adjacency list (in): table(3=[1, 2],2=[1, 3],1=[2, 3])

Changes




Do you have questions or comments?


Copyright © SciFace Software GmbH & Co. KG 2000