In discrete mathematics, when the end point and starting point of a path coincide, it is called a loop, so the loop belongs to a path.

Given graph g =

Extended data:

Number of nodes = number of edges+1

If all the vertices in a road G are different (and of course the edges are different), then G is called the main road.

What if? If all edges in a are different from each other, it is called. This is a simple road. When v0=v 1, this simple path is called a simple loop.

Discrete mathematics can be regarded as a bridge between mathematics and computer science, because discrete mathematics is not only inseparable from mathematical knowledge such as set theory and graph theory, but also related to database theory and data structure in computer science. It can lead people into the thinking field of computer science and promote the development of computer science.

Baidu Encyclopedia-Visit