## `Network::isEdge, Network::isVertex` -- checks whether an edge or vertex is contained in a network

#### Introduction

`Network::isEdge(G, e)` checks if `e` is an edge of network `G`.

`Network::isVertex(G, v)` checks if `v` is a vertex of network `G`.

#### Call(s)

`Network::isEdge(G, e)`
`Network::isVertex(G, v)`

#### Parameters

`G` | - | a network
`e` | - | a list of two expressions
`v` | - | an expression

#### Returns

`TRUE` or `FALSE`

#### Details

- `Network::isEdge(G, e)` gives `TRUE` if `e` is an edge in network `G`.
- `Network::isVertex(G, v)` return `TRUE` if `v` is a vertex in network `G`.

#### Example 1

Some examples for the use of these two functions:

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

                                    TRUE, FALSE

    >> Network::isVertex(N1, v1), Network::isVertex(N1, v5)

                                    TRUE, FALSE

#### Changes

- used to be called `[`
- Network::isEdge]Network::IsEdge
- used to be called `[`
- Network::isVertex]Network::IsVertex

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