Any two nodes, which are connected by an edge in a graph, are called adjacent nodes. For example, if an edge x E is associated with a pair of nodes
(u,v) where u, v V, then we say that the edge x connects the nodes u and v.
September 14, 2023 in Data Structure
Any two nodes, which are connected by an edge in a graph, are called adjacent nodes. For example, if an edge x E is associated with a pair of nodes
(u,v) where u, v V, then we say that the edge x connects the nodes u and v.