Various graph data structure terms

• Vertex (Node) Fundamental unit
• Edge Connection between two vertices.
• Directed / Undirected Edge Edge has direction (A→B) or not (A—B).
• Weight Cost/value assigned to an edge (optional).
• Degree Number of edges connected to a vertex (in-degree, out-degree for directed).
• Path Sequence of edges connecting two vertices.
• Cycle Path that starts and ends at the same vertex without repeating edges/nodes.
• Connected Graph There is a path between every pair of vertices.
• Disconnected Graph Some vertices cannot reach each other.
• Adjacency Two vertices are adjacent if connected by an edge.
• Neighbor Vertex directly connected to another vertex.
• Component Maximal connected subgraph.
• Spanning Tree Tree that includes all vertices of a connected graph without cycles.
• BFS / DFS Traversal algorithms (graph doesn’t have a root, so any node can start).