-
|
I need to implement hierholzer algorithm. Does networkx doesnt support it ? or is there any way I can implement this? |
Beta Was this translation helpful? Give feedback.
Replies: 1 comment 2 replies
-
|
Any reference or link or hint as to what this person's name is associated with? :} |
Beta Was this translation helpful? Give feedback.
-
|
Hello, also interested in Hierholzers. It's an algorithm for constructing Eulerian circuits in undirected graphs |
Beta Was this translation helpful? Give feedback.
-
|
Finding Eulerian circuits is provided in the function The description of Hierholzer's algorithm on the Wiki page seems to align quite closely with the implementation, at least at first glance. Whether the implementation is "Hierhozer-ian" enough for your use-case will depend on your specific criteria. However - if you want to find Eulerian circuits in Eulerian graphs, When searching the NetworkX docs, I'd recommend first searching by application (e.g. "Eulerian circuit") rather than by a specific named algorithm (e.g. "Hierhozers"). NetworkX tends to be organized by application/concept rather than by name! |
Beta Was this translation helpful? Give feedback.
Finding Eulerian circuits is provided in the function
nx.eulerian_circuit, defined here.The description of Hierholzer's algorithm on the Wiki page seems to align quite closely with the implementation, at least at first glance. Whether the implementation is "Hierhozer-ian" enough for your use-case will depend on your specific criteria. However - if you want to find Eulerian circuits in Eulerian graphs,
nx.eulerian_circuitis the place to start!When searching the NetworkX docs, I'd recommend first searching by application (e.g. "Eulerian circuit") rather than by a specific named algorithm (e.g. "Hierhozers"). NetworkX tends to be organized by application/concept rather than by name!