networks(deprecated)/departures - Maple Help
For the best experience, we recommend viewing online help using Google Chrome or Microsoft Edge.

Online Help

Home : Support : Online Help : networks(deprecated)/departures

networks

  

departures

  

neighboring vertices found along outgoing edges

 

Calling Sequence

Parameters

Description

Examples

Calling Sequence

departures(v, G)

departures(G)

Parameters

v

-

vertex of G

G

-

graph or network

Description

• 

Important: The networks package has been deprecated.  Use the superseding command GraphTheory[Departures] instead.

• 

Given a vertex v of a graph G, this routine returns the set of vertices which are at the head of edges directed out of v.

• 

Undirected edges are treated as if they were bidirectional.

• 

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

• 

When no vertices are specified a departures table, indexed by vertices, is constructed. This table is not part of the graph data structure so that the graph remains unaffected by assignments to the table.

• 

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

Examples

Important: The networks package has been deprecated.  Use the superseding command GraphTheory[Departures] instead.

(1)

(2)

(3)

(4)

(5)

(6)

(7)

(8)

(9)

(10)

(11)

See Also

GraphTheory

GraphTheory[Departures]

networks(deprecated)[arrivals]

networks(deprecated)[neighbors]

 


Download Help Document