union of two graphs
g2 = graph_union(g,g1 [,opt])
a graph data structure.
a boolean, with %t
as default value.
graph data structure of the new graph
graph_union(g,g1)
creates a new graph
g2
. The node set of g2
is the union (in
the usual sense) of the node sets of g
and
g1
. If node names are given in both graph, nodes with
equal names in g1
and g2
are considered
as common nodes.
g2
has an edge for each edge of g
and
an edge for each edge of g1
. The edges of
g
and g1
having the same endpoints are
kept and in this case g2
has multiple edges.
graph_union(g,g1,%f)
creates a new graph
g2
. The node set of g2
is the union (in
the usual sense) of the node sets of tg
and
g1
. In this case the function does not looks for
common nodes.
g2
has an edge for each edge of g
and an edge for each edge of
g1
. The edges of g
and g1
having the same endpoints are kept
and in this case g2
has multiple edges.