Dostałem od prowadzącego takie pytanie - "Dlaczego cykla Eulera nie jest cyklem ?". Choć wydawało mi się, że jest, to jednak z pytania wynika, że nie spełnia wszystkich warunków cyklu. Ktoś potrafi odpowiedzieć na to pytanie ?
0
0
In graph theory, the term cycle may refer to several closely related objects.
A closed walk, with repeated vertices allowed. See path (graph theory). (This usage is common in computer science. In graph theory it is more often called a closed walk.)
A closed (simple) path, with no other repeated vertices or edges other than the starting and ending vertices. (This usage is common in graph theory, see "Cycle graph") This may also be called a simple cycle, circuit, circle, or polygon.
A closed directed walk, with repeated vertices allowed. (This usage is common in computer science. In graph theory it is more often called a closed directed walk.)
A closed directed (simple) path, with no repeated vertices other than the starting and ending vertices. (This usage is common in graph theory.) This may also be called a simple (directed) cycle.