neighbor (adjacent vertex)
RU: сосед (смежная вершина)
A vertex v is a neighbor of u if an edge exists between them. In a directed graph, v is a neighbor of u only if edge (u,v) exists.
RU: сосед (смежная вершина)
A vertex v is a neighbor of u if an edge exists between them. In a directed graph, v is a neighbor of u only if edge (u,v) exists.