|
networks[gunion] - union of two graphs
|
|
Calling Sequence
|
|
gunion(G, H)
gunion(G, H, 'SIMPLE')
|
|
|
Parameters
|
|
|
G
|
-
|
graph or network
|
|
H
|
-
|
graph or network
|
|
'SIMPLE'
|
-
|
(optional) indicates that simple union wanted
|
|
|
|
|
|
Description
|
|
|
•
|
This procedure creates a graph whose vertex set is the usual set-theoretic union of the vertex sets of G and H, and which has an edge for each edge of G and for each edge of H.
|
|
•
|
Multiple edges that have the same endpoints are retained unless 'SIMPLE' is specified, in which case multiple edges are reduced to a single edge.
|
|
•
|
This routine is normally loaded by using the command with(networks), but it may also be referenced by using the full name networks[gunion](...).
|
|
|
Download Help Document
Was this information helpful?
