The eulerian module¶
Eulerian Measures class.
-
class
hcga.features.eulerian.
Eulerian
(graph=None)[source]¶ Eulerian Measures class.
Features based on Eulerian circuits. An Eulerian circuit is a closed walk that includes each edge of a graph exactly once.
Uses networkx, see ‘https://networkx.org/documentation/stable/reference/algorithms/euler.html`
References
- 1
J. Edmonds, E. L. Johnson. Matching, Euler tours and the Chinese postman. Mathematical programming, Volume 5, Issue 1 (1973), 111-114.
- 2
Initialise a feature class.
- Parameters
graph (Graph) – graph for initialisation, converted to given encoding