StackRating
An Elo-based rating system for Stack Overflow
Answers and rating deltas for
How to proof by induction that a strongly connected directed graph has at most 2n -2 edges?
| Author | Votes | Δ |
|---|---|---|
| Per | 2 | +3.58 |
| heneryville | -2 | -3.58 |
Last visited: Sep 14, 2014, 5:07:29 AM