The basic rule in Fleury's algorithm is
◦ only travel across a bridge on the original graph if there is no other alternative.
◦ only travel across a bridge of the untraveled part of the graph if there is no other alternative.
◦ never travel across a bridge of the original graph.
◦ never travel across a bridge of the untraveled part of the graph.
◦ none of these