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.
In more detail
The number of vertices is written V in complexity formulas, as in O(V + E). A vertex's neighbours are the vertices it has an edge to.
Related terms
- graph — A set of vertices (points) connected by edges (links), used to model networks such as roads, friendships or dependencies.
- edge — A connection between two vertices of a graph, or between a parent and child in a tree.
- neighbour — A vertex that is directly connected to a given vertex by an edge.
Taught in
- Representing A Graph: Matrix Or Adjacency List — Algorithms & Data Structures for Working Engineers
- Breadth-First Search And Shortest Paths By Hops — 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