Creado por Marcell Alves
hace alrededor de 7 años
|
||
Pregunta | Respuesta |
Faster to test if (x,y) is in graph? | Adjacency matrices |
Faster to find the degree of a vertex? | Adjacency lists |
Less memory on small graphs? | Adjacency lists (m + n) vs. (n²) |
Less memory on big graphs? | Adjacency matrices (a small win) |
Edge insertion or deletion? | Adjacency matrices O(1) vs. O(d) |
Faster to traverse the graph? | Adjacency lists θ(m + n) vs. θ(n²) |
Better for most problems? | Adjacency lists |
¿Quieres crear tus propias Fichas gratiscon GoConqr? Más información.