Classical eulerian cycle algorithm: Difference between revisions
Jump to navigation
Jump to search
| Line 4: | Line 4: | ||
''' Type of algorithm:''' recursion with an arbitrarily chosen start node as an additional input. | ''' Type of algorithm:''' recursion with an arbitrarily chosen start node as an additional input. | ||
== Induction basis == | |||
'''Abstract view:''' The output sequence <math>S</math> of nodes and arcs is initialized so as to contain the start node <math>s</math> and nothing else. | |||
== Induction step == | == Induction step == | ||
Revision as of 08:36, 12 October 2014
General information
Algorithmic problem: Eulerian cycle
Type of algorithm: recursion with an arbitrarily chosen start node as an additional input.
Induction basis
Abstract view: The output sequence [math]\displaystyle{ S }[/math] of nodes and arcs is initialized so as to contain the start node [math]\displaystyle{ s }[/math] and nothing else.