|
networks[tail] - finds the tail of a directed edge
|
|
Calling Sequence
|
|
tail(G)
tail(e, G)
tail(eset, G)
|
|
|
Parameters
|
|
|
G
|
-
|
graph or network
|
|
e
|
-
|
edge of G
|
|
eset
|
-
|
set or list of edges of G
|
|
|
|
|
|
Description
|
|
|
•
|
If only G is passed then a table indexed by edges and recording the vertices at the tail of selected edges is returned. The table is part of the graph data structure and is automatically maintained by procedures such as addedge() and delete().
|
|
•
|
If the first argument is a directed edge e then the tail of e is returned. For undirected edges the result is NULL.
|
|
•
|
The routine maps automatically onto a set or list of vertices when the first argument is a set or list.
|
|
•
|
It is normally loaded via the command with(networks) but may also be referenced using the full name networks[tail](...).
|
|
|
|
Examples
|
|
Important: The networks package has been deprecated.Use the superseding package GraphTheory instead.
|
>
|
|
|
>
|
|
|
>
|
|
|
>
|
![addedge([[1, 2], [2, 3], [3, 4], [4, 5]], G)](/support/helpjp/helpview.aspx?si=8254/file07446/math133.png)
|
|
| (1) |
|
>
|
|
|
| (2) |
|
>
|
|
|
>
|
|
|
![TABLE([e4 = 4, e3 = 3, e2 = 2, e1 = 1])](/support/helpjp/helpview.aspx?si=8254/file07446/math154.png)
| (3) |
|
>
|
![tail([e1, e2, e5], G)](/support/helpjp/helpview.aspx?si=8254/file07446/math158.png)
|
|
![[1, 2]](/support/helpjp/helpview.aspx?si=8254/file07446/math161.png)
| (4) |
|
|
Download Help Document
Was this information helpful?
