Interesting, but I was hoping the conclusion was going to be a bit deeper than what seems obvious to me – that the number of edges directed in must equal the number of edges directed out for each node in the graph. I’m also confused by the term “move”, which I associate with a move in checkers or chess. I’m not a mathematician so perhaps I lack an appreciation for rigor.
Interesting, but I was hoping the conclusion was going to be a bit deeper than what seems obvious to me – that the number of edges directed in must equal the number of edges directed out for each node in the graph. I’m also confused by the term “move”, which I associate with a move in checkers or chess. I’m not a mathematician so perhaps I lack an appreciation for rigor.