[ library(graph_algorithms) | Reference Manual | Alphabetic Index ]

# graph_get_edge(+Graph, +Source, +Target, -Edge)

Finds a graph edge given source and target node

Graph
  a graph structure
Source
  an integer node number
Target
  an integer node number
Edge
  an e/3 edge structure

## Description

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

### Modes and Determinism

- graph_get_edge(+, +, +, -) is semidet

### Fail Conditions

Fails if no matching edge exists

## See Also

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