## `Network::printGraph` -- print all information about a network

#### Introduction

`Network::printGraph` `G` prints all information about the network `G` on the screen.

#### Call(s)

`Network::printGraph(G)`

#### Parameters

`G` | - | network

#### Returns

The value of type `DOM_NULL`

#### Details

- `Network::printGraph` prints all known information about a network.

#### Example 1

    >> V := [1,2,3,q,s]:
       Edge := [[q,1], [1,2], [1,3], [2,3], [3,s]]:
       up := [5, 4, 4, 2, 5]:
       N1 := Network(V,Edge,Capacity=up):
       Network::printGraph(N1);

                             Vertices: [1, 2, 3, q, s]

                  Edges: [[q, 1], [1, 2], [1, 3], [2, 3], [3, s]]

                    Vertex weights: table(s=0,q=0,3=0,2=0,1=0)

          Edge capacities: table([3, s]=5,[2, 3]=2,[1, 3]=4,[1, 2]=4,[q,\
           1]=5)

          Edge weights: table([3, s]=1,[2, 3]=1,[1, 3]=1,[1, 2]=1,[q, 1]\
          =1)

           Adjacency list (out): table(s=[],q=[1],3=[s],2=[3],1=[2, 3])

            Adjacency list (in): table(s=[3],q=[],3=[1, 2],2=[1],1=[q])

#### Changes

- used to be called `Network::PrintGraph`

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