Posts Tagged Lista simpla

How to: Implement a Sparse Matrix Data Structure in C++ Using Simple Linked List

The storage structures for sparse matrixes are presented at [...].
The simply linked list is a linear data structure, formed by elements called nodes. A node is composed by two categories of fields:

  • The field with the information necessary for processing;
  • The field with the information for connecting with the successor node in the simply linked list type structure; it is defined as a pointer to the structure of the node in order to retain the address of the next node in the simply linked list.

Read the rest of this entry »

, , , ,

1 Comment

Implementarea structurii de date Matrice Rara in C++ utilizand lista simplu inlantuita

Structurile de stocare a matricelor rare sunt prezentate la [...].
Lista simpla este o structura de date liniara, formata din elemente denumite noduri. Un nod este compus din doua categorii de campuri:

  • Campul cu informatia necesara prelucrarii;
  • Campul cu informatia de legatura cu nodul succesor in cadrul structurii de tip lista simpla; se defineste sub forma de pointer catre structura nodului pentru a retine adresa nodului care urmeaza in cadrul listei simple.

Read the rest of this entry »

, , , ,

2 Comments