Community Page
- 20bits.com Jump to website »
-
Subscribe -
Community
-
Top Commenters
-
Popular Threads
-
Recent Comments
- The people go outside?
- to bold write just *text* wullah
- forgot (^^^) the shark
- Hi Jesse, I just came across your site while I was searching for more details on the influence function. You have mentioned that "calculating the influence function exactly is NP-hard" -...
- The Erlang documentation covers its approach to in-place code upgrades here: http://erlang.org/doc/design_principles/part_frame.html . In particular, see the sections "Releases" and...
1 year ago
1 year ago
Look at row 1. It indicates that vertex 1 is connected to vertices 2 and 4. When in fact it is connected to vertices 2 and 3.
If the graph had vertices in clockwise order v1, v2, v3, v4 as James suggests, then this adjacency matrix would be correct.
Enjoying reading your blog very much and looking forward to the next part in this series!!
1 year ago
You're right, but it'd be a pain in the butt to go back and correct it. The error will have to stand.
9 months ago
should that not read that "Scalar multiplication distributes over vector addition?"
4 months ago