[ library(graph_algorithms) | Reference Manual | Alphabetic Index ]
# graph_get_edges(+Graph, +Source, +Target, -Edges)

Finds all edges between source node and target node
*Graph*
- a graph structure
*Source*
- an integer node number
*Target*
- an integer node number
*Edges*
- a list of e/3 edge structures

## Description

This operation is linear in the number of edges adjacent to Source.

### Modes and Determinism

- graph_get_edges(+, +, +, -) is det

## See Also

graph_get_all_edges / 2, graph_get_adjacent_edges / 3, graph_edge / 2, graph_adjacent_edge / 3, graph_get_edge / 4