networks(deprecated)/departures - Help

Online Help

All Products    Maple    MapleSim


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

networks[departures] - neighboring vertices found along outgoing edges

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.

withnetworks:

G:=complete4:

addvertex0,G

0

(1)

connect0,1,G,directed

e7

(2)

arrivals0,G

(3)

departures0,G

1

(4)

neighbors0,G

1

(5)

arrivals1,G

0,2,3,4

(6)

departures1,G

2,3,4

(7)

neighbors1,G

0,2,3,4

(8)

arrivalsG

table0=,1=0,2,3,4,2=1,3,4,3=1,2,4,4=1,2,3

(9)

departuresG

table0=1,1=2,3,4,2=1,3,4,3=1,2,4,4=1,2,3

(10)

neighborsG

table0=1,1=0,2,3,4,2=1,3,4,3=1,2,4,4=1,2,3

(11)

See Also

GraphTheory, GraphTheory[Departures], networks(deprecated)[arrivals], networks(deprecated)[neighbors]


Download Help Document

Was this information helpful?



Please add your Comment (Optional)
E-mail Address (Optional)
What is ? This question helps us to combat spam