Note: This page has been translated by MathWorks. Please click here

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

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

Graph with undirected edges

`graph`

objects represent undirected graphs, which have
direction-less edges connecting the nodes. After you create a graph object, you can
learn more about the graph by using object functions to perform queries against the
object. For example, you can add or remove nodes or edges, determine the shortest path
between two nodes, or locate a specific node or edge.

G = graph([1 1], [2 3]); e = G.Edges G = addedge(G,2,3) G = addnode(G,4) plot(G)

`G = graph`

`G = graph(A)`

`G = graph(A,nodenames)`

`G = graph(A,NodeTable)`

`G = graph(A,___,type)`

`G = graph(A,___,'OmitSelfLoops')`

`G = graph(s,t)`

`G = graph(s,t,weights)`

`G = graph(s,t,weights,nodenames)`

`G = graph(s,t,weights,NodeTable)`

`G = graph(s,t,weights,num)`

`G = graph(s,t,___,'OmitSelfLoops')`

`G = graph(s,t,EdgeTable,___)`

`G = graph(EdgeTable)`

`G = graph(EdgeTable,NodeTable)`

`G = graph(EdgeTable,___,'OmitSelfLoops')`

creates an empty
undirected graph object, `G`

= graph`G`

, which has no nodes or
edges.

creates a weighted graph using a square, symmetric adjacency matrix,
`G`

= graph(`A`

)`A`

. The location of each nonzero entry in
`A`

specifies an edge for the graph, and the weight of
the edge is equal to the value of the entry. For example, if ```
A(2,1)
= 10
```

, then `G`

contains an edge between node
2 and node 1 with a weight of 10.

specifies graph edges `G`

= graph(`s,t`

)`(s,t)`

in node pairs.
`s`

and `t`

can be numeric, character
vectors, or cell arrays of character vectors with the same number of
elements.

does not add any self-loops to the graph. That is, any `G`

= graph(`s,t`

,___,'OmitSelfLoops')`k`

that satisfies `s(k) == t(k)`

is ignored. You can use any
of the input argument combinations in previous syntaxes.

uses the table `G`

= graph(`EdgeTable`

)`EdgeTable`

to define the graph. With this
syntax, the first variable in `EdgeTable`

must be named
`EndNodes`

, and it must be a two-column array defining
the edge list of the graph.

does not add self-loops to the graph. That is, any `G`

= graph(`EdgeTable`

,___,'OmitSelfLoops')`k`

that
satisfies ```
EdgeTable.EndNodes(k,1) ==
EdgeTable.EndNodes(k,2)
```

is ignored. You must specify
`EdgeTable`

and optionally can specify
`NodeTable`

.

Access and Modify Nodes and Edges

Search and Structure

`bfsearch` | Breadth-first graph search |

`dfsearch` | Depth-first graph search |

`centrality` | Measure node importance |

`conncomp` | Connected graph components |

`biconncomp` | Biconnected graph components |

`bctree` | Block-cut tree graph |

`maxflow` | Maximum flow in graph |

`minspantree` | Minimum spanning tree of graph |

`isisomorphic` | Determine whether two graphs are isomorphic |

`isomorphism` | Compute equivalence relation between two graphs |

Shortest Path

`shortestpath` | Shortest path between two single nodes |

`shortestpathtree` | Shortest path tree from node |

`distances` | Shortest path distances of all node pairs |

Matrix Representation

Node Information

Visualization

`plot` | Plot graph nodes and edges |

Was this topic helpful?