Skip to main content
14 events
when toggle format what by license comment
Jun 16, 2020 at 9:23 history edited CommunityBot
Commonmark migration
S Mar 27, 2019 at 1:24 history bounty ended Mario Krenn
S Mar 27, 2019 at 1:24 history notice removed Mario Krenn
Mar 25, 2019 at 11:09 answer added Szabolcs timeline score: 6
Mar 25, 2019 at 9:00 history tweeted twitter.com/StackMma/status/1110104145317584896
S Mar 25, 2019 at 5:14 history bounty started Mario Krenn
S Mar 25, 2019 at 5:14 history notice added Mario Krenn Draw attention
Jan 5, 2015 at 4:47 vote accept latkin
Jan 5, 2015 at 1:10 answer added halmir timeline score: 3
Jan 4, 2015 at 22:17 comment added latkin Ah, indeed, there it is buried at the end of the "Background" section. Nice find, @halmir. If you want to submit that as an answer I'll accept it.
Jan 4, 2015 at 16:18 comment added halmir in documentation, FindCycle returns simple cycles, while FindHamiltonianCycle, FindEulerianCycle, and FindFundamentalCycles return specific types of cycles.
Jan 3, 2015 at 1:09 comment added David G. Stork Note too: FindPostmanTour[g] gives the full Eulerian cycle for your case.
Jan 3, 2015 at 1:03 comment added David G. Stork I presume Mathematica searches for "simple cycles," i.e., no repetitions of vertexes, even though the EulerianCycle is somehow found. An Eulerian cycle in a directed graph can of course pass through the same vertex more than once.
Jan 3, 2015 at 0:52 history asked latkin CC BY-SA 3.0