Note: This page has been translated by MathWorks. Click here to see

To view all translated materials including this page, select Country from the country navigator on the bottom of this page.

To view all translated materials including this page, select Country from the country navigator on the bottom of this page.

Reduce multigraph to simple graph

`H = simplify(G)`

`H = simplify(G,pickmethod)`

`H = simplify(G,aggregatemethod)`

`H = simplify(___,selfloopflag)`

`H = simplify(___,Name,Value)`

`[H,eind,ecount] = simplify(___)`

specifies a method to choose between multiple edges. Edge properties are preserved.
`H`

= simplify(`G`

,`pickmethod`

)`pickmethod`

can be `'first'`

(default),
`'last'`

, `'min'`

, or
`'max'`

.

specifies a method to combine the edge weights of multiple edges into the weight of
a single new edge. All other edge properties in `H`

= simplify(`G`

,`aggregatemethod`

)`G`

are dropped.
`aggregatemethod`

can be `'sum'`

or
`'mean'`

.

specifies whether to preserve or remove self-loops from the graph using any of the
input argument combinations in previous syntaxes. For example,
`H`

= simplify(___,`selfloopflag`

)`'keepselfloops'`

specifies that nodes with one or more
self-loops will have one self-loop in the simplified graph.

specifies additional options with one or more name-value pair arguments. For
example, you can specify `H`

= simplify(___,`Name,Value`

)`'PickVariable'`

and a variable in
`G.Edges`

to use that variable with the
`'min'`

or `'max'`

selection methods.

`digraph`

| `graph`

| `ismultigraph`