CSE

A graph G = (V,E) consists of a nonempty set V of Vertices or Nodes and a set of E of Edges. Each Edge has either one or two vertices associated with it, called its endpoints.

linear data structure stack