H = reordernodes(G,order)
reorders the nodes in graph G according to
order. This reordering corresponds to a symmetric permutation
of the adjacency matrix of G.

[H,idx]
= reordernodes(G,order)
also returns the permutation vector for the edge indices, idx.
For example, if G.Edges has a variable Weight,
then H.Edges.Weight == G.Edges.Weight(idx).

Input graph, specified as either a graph or digraph
object. Use graph to create an undirected graph or
digraph to create a directed graph.

Example: G = graph(1,2)

Example: G = digraph([1 2],[2 3])

order — Node order node indices | node names

Node order, specified as node indices or node names.
order specifies a symmetric permutation of the
adjacency matrix of G. If A =
adjacency(G), then A(order,order) produces
adjacency(H).

order can be one of:

Numeric vector of node indices, such as [1 3
2].

A cell array of character vectors or string array of node
names, such as {'A' 'C' 'B'} or ["A"
"C" "B"].

Output graph, returned as a graph or
digraph object. H contains the
same Nodes and Edges properties as
G, but with the rows of H.Nodes
and H.Edges permuted:

H.Nodes is the same as
G.Nodes(order,:).

H.Edges is similar to
G.Edges(idx,:), except that the nodes are
renumbered.

idx — Permutation vector of edge indices vector

Permutation vector of edge indices, returned as a vector. The values in
idx describe the permutation of the rows in
G.Edges.

You can also select a web site from the following list:

How to Get Best Site Performance

Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.