hasEulerianCycle: Method for checking whether an eulerian cycle exists.

Description Usage Arguments Details Value Author(s) Examples

View source: R/eulerian.R

Description

An eulerian cycle is a path in a graph which visits every edge exactly once, and starts and ends at the same node.

Usage

1

Arguments

graph

a graphNEL object.

Details

A graph will have an euler cycle if and only if every node has same number of edges entering into and going out of it.

Value

TRUE, if graph has an auler cycle. FALSE, otherwise.

Author(s)

Ashis Saha

Examples

1
2
3
4
5
	require(graph)
	require(eulerian)
	g <- new("graphNEL", nodes=LETTERS[1:4], edgemode="directed")
	g <- addEdge(graph=g, from=LETTERS[1:4], to=LETTERS[c(2:4,1)])
	hasEulerianCycle(g)

eulerian documentation built on May 19, 2017, 8:13 a.m.

Search within the eulerian package
Search all R packages, documentation and source code

Questions? Problems? Suggestions? Tweet to @rdrrHQ or email at ian@mutexlabs.com.

Please suggest features or report bugs in the GitHub issue tracker.

All documentation is copyright its authors; we didn't write any of that.