# outedges

Outgoing edges from node

## Description

## Examples

## Input Arguments

## Output Arguments

## Tips

By convention, for undirected graphs, all edges incident to a node are considered to be outgoing edges. Use

`inedges`

to find incoming edges in a directed graph.For graphs with multiple edges,

`outedges`

and`successors`

can return arrays of different lengths, since there can be multiple outgoing edges to some of the successors.

## Extended Capabilities

## Version History

**Introduced in R2018a**

## See Also

`graph`

| `digraph`

| `successors`

| `inedges`