DirectedEdge

A directed edge from u to v — the edge head Graph holds in its edge list.

✓ checked against that system · ! checked, with disagreements (hover a chip)Wolfram LanguageDirectedEdge✓↗

DirectedEdge(u, v)an edge FROM $u$ TO $v$ — FindShortestPath and GraphDistance only traverse it forward, from $u$ to $v$.

Typed signatures

Type	Package	Applies
(any, any) -> value	combinatorics	always

Domain: Collections

Details

• Inert, like Graph itself — it holds exactly as written.
• Wolfram prints this infix as $u \to v$ (u -> v); Epsil's own -> already means KeyValuePair (not this), so this round-trips through call-form syntax, DirectedEdge(u, v), which Wolfram accepts as equivalent input.

Examples

Basic #

An edge from 1 to 2

live ↗

In$\mathrm{DirectedEdge}(1, 2)$Out$\mathrm{DirectedEdge}(1, 2)$

About

Examples	1
Checked against	Wolfram Language 1 agree
Crosswalk	Wolfram Language

See also: UndirectedEdge, Graph