Talk:Graph (abstract data type)

message: Where are these time complexity bounds coming from??  I see that this table was introduced in June 13, 2011, and that the figures in the table have changed over time.  Does anybody have a reference for this information? Klortho (talk) 03:23, 20 November 2011 (UTC)
thread_title:  Need citations for time complexity table 

message: There used to be a lot of useful links at the foot of this article. The ones that remain are not as useful as the ones that were removed, and seem a bit random.  —Preceding unsigned comment added by 87.113.232.148 (talk) 07:41, 4 November 2010 (UTC)
replies: text: A topic identical to some of the former external links is already covered by internal links in the main article body. Readers should be directed away from Wikipedia by external links only when they significantly expand the subject beyond Wikipedia's own content. A long list of links to various implementations is not appropriate for Wikipedia. See the guideline for external links for more information. ✤ JonHarder talk 12:53, 7 November 2010 (UTC)
thread_title:  Where have all the links gone? 

message: Hi there, I think there is an improving fact missing: so using a sparse matrix will offer a fast access to the nodes for reading and writing, also the advantage of finding adjacent vertexes stays preserved. Just my 2 cent.  — Preceding unsigned comment added by 178.25.211.175 (talk) 16:21, 8 July 2012 (UTC)
thread_title:  Complexity 

message: I don't think the adjacency list is correct about the time complexity:
Query: are vertices u, v adjacent? (Assuming that the storage positions for u, v are known)
O(|V|)
If we store edges in a hash-set (e.g., std::unordered_map<Edge>), we can look up the existence of any potential edge in O(1). That's assuming the data is stored on the graph object itself, but even if we insist on store it in the vertex, like it says,
and every vertex stores a list of adjacent vertices.
…if we say the "list" is a hash-set, it's still O(1). Similarly, such a data structure should allow remove edge to be O(1). Storage is still O(|V| + |E|).
Of course, the Big-O cheat sheet contradicts this, but it seems like if we simply select the correct data structure, we can achieve these complexities.
—Deathanatos (talk) 08:03, 17 July 2014 (UTC)
replies: text: Storing all the edges in a hash table is a different data structure than an adjacency list. But your second variation, storing the neighbors of each vertex in a hash table, can be interpreted as a variant of the adjacency list and as you say achieves constant time adjacency tests. —David Eppstein (talk) 15:42, 17 July 2014 (UTC)
thread_title:  Adjacency list time complexity? 

message: There is a move discussion in progress on Talk:Associative array which affects this page. Please participate on that page and not in this talk page section. Thank you.  —RMCD bot 00:32, 27 January 2022 (UTC)
thread_title:  Move discussion in progress 

message: The redirect Graph (data structure has been listed at redirects for discussion to determine whether its use and function meets the redirect guidelines. Readers of this page are welcome to comment on this redirect at  until a consensus is reached.  Utopes (talk / cont) 20:42, 3 February 2024 (UTC)
thread_title:  "[[:Graph (data structure]]" listed at [[Wikipedia:Redirects for discussion|Redirects for discussion]]