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.

Shortest path tree from node

`TR = shortestpathtree(G,s)`

`TR = shortestpathtree(G,s,t)`

`TR = shortestpathtree(___,Name,Value)`

```
[TR,D] =
shortestpathtree(___)
```

```
[TR,D,E] =
shortestpathtree(___)
```

returns a directed graph, `TR`

= shortestpathtree(`G`

,`s`

)`TR`

, that contains the tree of shortest
paths from source node `s`

to all other nodes in the graph. If the
graph is weighted (that is, `G.Edges`

contains a variable
`Weight`

), then those weights are used as the distances along
the edges in the graph. Otherwise, all edge distances are taken to be
`1`

.

uses additional options specified by one or more Name-Value pair arguments, using
any of the input argument combinations in previous syntaxes. For example,
`TR`

= shortestpathtree(___,`Name,Value`

)`shortestpathtree(G,s,'OutputForm','vector')`

returns a numeric
vector that describes the shortest path tree.

The

`shortestpath`

,`shortestpathtree`

, and`distances`

functions do not support undirected graphs with negative edge weights, or more generally any graph containing a negative cycle, for these reasons:A

*negative cycle*is a path that leads from a node back to itself, with the sum of the edge weights on the path being negative. If a negative cycle is on a path between two nodes, then no shortest path exists between the nodes, since a shorter path can always be found by traversing the negative cycle.A single negative edge weight in an undirected graph creates a negative cycle.

`digraph`

| `distances`

| `graph`

| `nearest`

| `shortestpath`

Was this topic helpful?