<![CDATA[What is generally true of Adjacency List and Adjacency Matrix representations of graphs?]]>In graph theory and computer science, an adjacency list is a collection of unordered lists used to represent a finite graph. Each list describes the set of neighbors of a vertex in the graph. This is one of several commonly used representations of graphs for use in computer programs.

]]>https://community.secnto.com//topic/1517/what-is-generally-true-of-adjacency-list-and-adjacency-matrix-representations-of-graphsRSS for NodeMon, 08 Jun 2026 20:45:58 GMTSun, 16 Feb 2020 07:21:51 GMT60<![CDATA[Reply to What is generally true of Adjacency List and Adjacency Matrix representations of graphs? on Sun, 16 Feb 2020 07:23:09 GMT]]>@moaaz said in What is generally true of Adjacency List and Adjacency Matrix representations of graphs?:

  • Lists require less space than matrices but take longer to find the weight of an edge (v1,v2)
]]>https://community.secnto.com//post/4013https://community.secnto.com//post/4013Sun, 16 Feb 2020 07:23:09 GMT