A graph $$G=(V,E)$$ consists of a set $$V$$ of vertices (or nodes) and a set $$E$$ of edges; every edge in E connects two vertices in V. Two vertices are called adjacent if there is an edge between them.