Archive for November, 2009

How to: Use a DLL – Dynamic Link Library in C++ as Visual Studio 2008 Project

Posted by Marius in C++, Data Structures on November 3, 2009

The usage of the programming elements included in DLL’s [...] it is made in C++ applications by respecting the rules stated below.
The usage of a DLL in the C++ programming language in the Visual Studio programming environment, it is made in the following way:

  • Create a C++ project – type: Console application;
  • Define the content for the source file which uses elements included in the DLL;
  • Create the executable file.

Read the rest of this entry »

, , , ,

2 Comments

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

Posted by Marius in C++, Data Structures on November 2, 2009

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

How to: Implement Sparse Matrix Data Structure in C++ Using Array

Posted by Marius in C++, Data Structures on November 2, 2009

The sparse matrix represents a special type of two-dimensional array consisting of a large number of elements from out of which a very high proportion is occupied by null elements. Thus, the classical declaration of a two-dimensional array in the C++ programming language leads to unnecessary use of memory by storing null values and of the processing capacity.
Read the rest of this entry »

, , , , ,

1 Comment