Network::isEdge,
Network::isVertex
-- checks whether an edge or vertex is
contained in a networkNetwork::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
.
Network::isEdge(G, e)
Network::isVertex(G, v)
G |
- | a network |
e |
- | a list of two expressions |
v |
- | an expression |
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
.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
[
[