## `Network::edge` -- returns a list with all edges

#### Introduction

`Network::edge``(G)` returns the list of all edges of the network `G`.

#### Call(s)

`Network::edge(G)`

#### Parameters

`G` | - | a network

#### Returns

the list of all edges, a list of lists

#### Details

- `Network::edge``(G)` returns a list with all edges of the network `G`. Each edge is represented by a list containing the two connected vertices.

#### Example 1

`Network::edge` only returns the edges, without their capacities.

    >> N1 := Network::cycle([v1,v2,v3,v4]):
       Network::edge(N1)

                     [[v1, v2], [v2, v3], [v3, v4], [v4, v1]]

    >> N2 := Network::complete(3):
       Network::edge(N2)

                 [[1, 2], [1, 3], [2, 1], [2, 3], [3, 1], [3, 2]]

#### Changes

- used to be called `Network::Edge`

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