Cody

Joseph Kirk

502
Rank
9
Badges
1680
Score
101 – 150 of 258

Joseph Kirk submitted a Comment to Problem 1170. Count the Number of Undirected Cycles in a Graph

That is correct. In a directed graph, the cycle 1 -> 2 -> 1 actually uses two different edges, while in an undirected graph, the edge 1 -> 2 and 2 -> 1 are one and the same. I am only considering cycles valid if each node along the way is visited once and if edges are not used more than one time. I chose this criteria so that the number of cycles counted would match the results for the table provided here: http://mathworld.wolfram.com/GraphCycle.html

on 5 Jan 2013

Joseph Kirk received Tiles Challenge Master badge

on 4 Jan 2013

101 – 150 of 258