Timeline for Find the most-connected nodes in a graph
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 7, 2017 at 21:50 | comment | added | Edward |
It's not exactly an error; it's just weird. The syntax in the original is legal but strange C++ and the version I show above is legal C++ and not strange. Dropping the second Coordinate is required or it would be a syntax error when Coordinate is used later.
|
|
| Jun 7, 2017 at 21:47 | comment | added | Deduplicator |
I do believe typedef struct Coordinate { /*...*/ }; is an error. You dropped a second Coordinate.
|
|
| Jun 7, 2017 at 16:57 | vote | accept | CarrotCake | ||
| Jun 7, 2017 at 15:44 | comment | added | Edward | I've changed the wording to simply say that it is "initialized to zero" without specifying the particular mechanism. | |
| Jun 7, 2017 at 15:43 | history | edited | Edward | CC BY-SA 3.0 |
clarified zero initialized
|
| Jun 7, 2017 at 15:32 | comment | added | Rakete1111 |
Node: If a key doesn't exist in an std::unordered_map, it is not zero initialized, but value initialized. Which is technically not the same thing.
|
|
| Jun 7, 2017 at 15:30 | history | edited | Edward | CC BY-SA 3.0 |
edited body
|
| Jun 7, 2017 at 15:25 | history | answered | Edward | CC BY-SA 3.0 |