find_euler

It finds an Eulerian cycle using a
\(O(q)\) algorithm where \(q\) is the number of edges of
the graph.

Informal implementation of some algorithms from Graph
Theory and Combinatorial Optimization which arise in the subject
"Graphs and Network Optimization" from first course of the EUPLA
degree of Data Engineering in Industrial Processes.

Cesar Asensio

Algorithms for the Subject Graphs and Network Optimization

find_euler function

<dl><dt>G</dt>
<dd>Eulerian and connected graph</dd>
<dt>v</dt>
<dd>Any vertex as starting point of the cycle</dd></dl>

Arguments

This function is part of the subject "Graphs and Network
Optimization". It is designed for teaching purposes only, and
not for production.<ul>
<li>It is introduced in the "Connectivity" section.</li>
<li>It is used as a subroutine in the "TSP" section.</li>
</ul>

Disclaimer

Author

Constructing an Eulerian Cycle — find_euler

<dl>

<dt>G</dt>
<dd>Eulerian and connected graph</dd>


<dt>v</dt>
<dd>Any vertex as starting point of the cycle</dd>

</dl>

This function is part of the subject "Graphs and Network
Optimization". It is designed for teaching purposes only, and
not for production.<ul>
<li>It is introduced in the "Connectivity" section.</li>
<li>It is used as a subroutine in the "TSP" section.</li>
</ul>

find_euler: Constructing an Eulerian Cycle

Description

Usage

Value

Arguments

Disclaimer

Author

Details

References

See Also

Examples