Given a vertex v of a graph G, this routine returns the set of vertices which are at the tail of edges directed into v or at the end of an undirected edge incident with v. Thus, undirected edges are treated as if they were bidirectional.

•

If v is a set of vertices then arrival is defined in terms of arrival into the subgraph induced by v in G.

•

When called with just the graph as a single argument, an arrivals table indexed by vertices is constructed. This table is not part of the graph data structure. In particular, this means that any direct assignments to this table have no effect on the graph itself.

•

The arrivals and departure information is constructed from the neighbors table which is automatically maintained by the main graph primitives such as addedge() and delete().

•

This routine is normally loaded via the command with(networks) but may also be referenced using the full name networks[arrivals](...).

## Was this information helpful?