edge
A connection between two vertices of a graph, or between a parent and child in a tree.
In more detail
The number of edges is written E in complexity formulas. An edge can be directed, one-way, and can carry a weight. A tree with n nodes always has n minus one edges.
Related terms
- vertex — One point in a graph, such as a city on a road map or a person in a social network; also called a node.
- graph — A set of vertices (points) connected by edges (links), used to model networks such as roads, friendships or dependencies.
- directed graph — A graph whose edges are one-way: an edge from A to B does not imply an edge from B to A.
- weighted graph — A graph in which every edge carries a number, its weight, such as a distance, cost or travel time.
Taught in
- Linked Lists: Nodes, Pointers And Sentinels — Algorithms & Data Structures for Working Engineers
- Binary Trees And Their Traversals — Algorithms & Data Structures for Working Engineers
- Representing A Graph: Matrix Or Adjacency List — Algorithms & Data Structures for Working Engineers
- Depth-First Search, Cycles And Topological Order — Algorithms & Data Structures for Working Engineers
- Dijkstra: Shortest Paths With A Priority Queue — Algorithms & Data Structures for Working Engineers
- Minimum Spanning Trees: Kruskal And Prim — Algorithms & Data Structures for Working Engineers