Description: One of the most interesting and powerful dynamic memory and pointers are undoubtedly dynamic data structures. The basic structures available in C and C + + (structs and arrays) have an important limitation: it can be resized at runtime. The arrays are composed of a number of elements, a number that is decided in the design phase, before the executable program is created.
In many cases structures are needed that can change in size during program execution. Of course, we can create dynamic arrays, but once created, your size will also be fixed, and to make it grow or shrink in size, we will rebuild from the beginning
To Search:
File list (Check if you may need any files):
GrafoLista
..........\.DS_Store
__MACOSX
........\GrafoLista
........\..........\._.DS_Store
GrafoLista\arch.txt
..........\classes
..........\.......\Adyacente.class
..........\.......\arch.txt
..........\.......\Cola.class
..........\.......\GrafoLista.class
..........\.......\ListaV.class
..........\.......\Nodo.class
..........\.......\Vertice.class
..........\GrafoLista.jcd
..........\GrafoLista.jcp
..........\GrafoLista.jcu
..........\GrafoLista.jcw
..........\GrafoLista2.jcd
..........\GrafoLista2.jcu
..........\GrafoLista2.jcw
..........\src
..........\...\Adyacente.java
..........\...\GrafoLista.java
..........\...\ListaV.java
..........\...\Vertice.java
..........\src_grafolista.txt
Download