Discrete Mathematics, Discrete Maths, Combinatorics, Permutations, Graph Theory.
edges can be directed or undirected, weighted or unweighted, and can represent any type of relationship between the vertices. One of the basic concepts in graph theory is that of a walk, which is a sequence of vertices connected by edges, starting and ending at the same vertex. A path is a walk