A path in a graph is a succession of adjacent edges, with no repeated edges. That is a definition. A circuit is a path that leads to another. That is a definition. A path that contains every edge in a graph is called an Euler path.
Let's Get It Fixed!
HomeX virtual experts will assess your issue (for free!) and can resolve simple problems.