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 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.