Comments on: Computer Algorithms: Graphs and their Representation /2012/08/31/computer-algorithms-graphs-and-their-representation/ on web development Fri, 26 Oct 2018 21:40:18 +0000 hourly 1 https://wordpress.org/?v=5.0.3 By: Raki /2012/08/31/computer-algorithms-graphs-and-their-representation/comment-page-1/#comment-452255 Thu, 11 May 2017 17:18:38 +0000 /?p=3322#comment-452255 How is Adjancency List adding an edge O(Log(n)). Can you please explain I am so confused.

]]> By: John Yearsley /2012/08/31/computer-algorithms-graphs-and-their-representation/comment-page-1/#comment-408525 Mon, 23 May 2016 06:41:12 +0000 /?p=3322#comment-408525 Cool thanks!

]]> By: Stoimen /2012/08/31/computer-algorithms-graphs-and-their-representation/comment-page-1/#comment-408524 Mon, 23 May 2016 06:38:31 +0000 /?p=3322#comment-408524 Nope. Go ahead!

]]> By: John Yearsley /2012/08/31/computer-algorithms-graphs-and-their-representation/comment-page-1/#comment-408360 Sun, 22 May 2016 03:58:58 +0000 /?p=3322#comment-408360 Hi, do you mind if I use any of these images in a report I am writing?

]]> By: Prince Nemo /2012/08/31/computer-algorithms-graphs-and-their-representation/comment-page-1/#comment-17879 Tue, 18 Dec 2012 19:05:42 +0000 /?p=3322#comment-17879 And “Adjacency Lists” Img fix pls

]]> By: Prince Nemo /2012/08/31/computer-algorithms-graphs-and-their-representation/comment-page-1/#comment-17878 Tue, 18 Dec 2012 18:54:48 +0000 /?p=3322#comment-17878 Pls fix image “Directed Graph And Adjacency Matrix” below written “Undirected”

]]> By: Chandra R /2012/08/31/computer-algorithms-graphs-and-their-representation/comment-page-1/#comment-17747 Wed, 12 Dec 2012 05:58:25 +0000 /?p=3322#comment-17747 Thanks. I understood this better here than most other places on the internet; 8 pictures and article shorter by 8000 words 🙂

]]> By: Dharmi /2012/08/31/computer-algorithms-graphs-and-their-representation/comment-page-1/#comment-17007 Thu, 01 Nov 2012 01:12:39 +0000 /?p=3322#comment-17007 The graphics makes it easier to digest. nice article.
One complexity can be added (if relevant). Inserting a node in between two nodes in an arbitrary graph.

]]> By: Joel Costigliola /2012/08/31/computer-algorithms-graphs-and-their-representation/comment-page-1/#comment-16570 Tue, 11 Sep 2012 13:37:25 +0000 /?p=3322#comment-16570 minor error : Adjacency Lists schema still mentions Adjacency Matrix.

nice article though

]]> By: Nico /2012/08/31/computer-algorithms-graphs-and-their-representation/comment-page-1/#comment-16529 Mon, 03 Sep 2012 12:32:28 +0000 /?p=3322#comment-16529 Hello!

May I ask why you are using non-zero weights in the adjacency matrix for the directed graph?

Ex.
If you have (A)---->(B), then matrix(A,B) is 1 and matrix(B,A) is -1 and not 0?

]]>