An eulerian path is a path in a graph which visits every edge exactly once. This function returns an eulerian path from a graph (if there is any). It works for both directed and undirected graphs.
1 
graph 
a 
start 

If start
is not NULL
, then eulerian returns a path starting from it. Otherwise, the start node is automatically selected.
A character vector representing an eulerian path/cycle in graph
. Each entry in the vector represents the name of a node in the graph.
Ashis Saha
1 2 3 4 5 6 7 8 9 10  require(graph)
require(eulerian)
g < new("graphNEL", nodes=LETTERS[1:4], edgemode="uirected")
g < addEdge(graph=g, from=LETTERS[1:3], to=LETTERS[2:4])
ep < eulerian(g)
g < new("graphNEL", nodes=as.character(1:10), edgemode="directed")
g < addEdge(graph=g, from=c("1","2","2","3","4","5","6","6","7","8","9","10"),
to=c("10","1","6","2","2","4","5","8","9","7","6","3"))
ep < eulerian(g, "6")

Questions? Problems? Suggestions? Tweet to @rdrrHQ or email at ian@mutexlabs.com.
Please suggest features or report bugs with the GitHub issue tracker.
All documentation is copyright its authors; we didn't write any of that.