Euler Path -->> If a graph is weakly connected or is w/o repetition of edges and
Indegree= outdegree for all except for two vertices. One out of those two has indegree = outdegree+1. Other has indegree+1 = outdegree.
Euler Circuit -->> If a graph is weakly connected or is w/o repetition of edges and
Indegree= outdegree.