N-ary Tree Data Structure API in Java

TreeDS4j is a Java (6+) API that allows handling n-ary tree data structure in such a flexible way. Indeed, the user is subject to enter structured and coherent data, and the latter would be stored in an hierarchy, accordingly. The link below contains two samples that show how to take advantage of the API.


Commentaires

Enregistrer un commentaire

Posts les plus consultés de ce blog

Indirect Recursion - A Natural Phenomenon

Image
Indirect recursion could be noticed in seeds and trees: a seed ends up to be a tree, and the latter produces many seeds, which themselves become trees and so forth. An interesting case was beautifully described in the Qur'an, chapter 2, verse 261, a plain description that is easy  to represent: " The example of those who spend their wealth in the way of Allah is like a seed [of grain] which grows seven spikes ; in each spike is a hundred grains. And Allah multiplies [His reward] for whom He wills. And Allah is all-Encompassing and Knowing ". ( Source ). Regardless of the religious aspects, one can notice the exponential growth of seeds, which is appreciated in agriculture, but seriously deprecated in Computer Science. If we represent this phenomenon (seeds and spikes) as a Java algorithm: void seed(x) { System.out.println("Seed " + x); for (i = 0; i < 7; i ++) { spike(i); } } void spike(y) { System.out.println("Sp...
Lire la suite

Delving into Algorithm Analysis - Deducing the Mathematical Representation of a Determined Study Case (II) [Iterative Algorithms and Sigma Notation]

Image
In the precedent post, we concluded that the following code fragment: for (i = k; k <= n; i += inc) { /* * instructions */ } is equivalent to the following mathematical representation: Let's find out what the above series is equal to ( replace "instructions" by c [short of constant] ). Here, we have finally obtained the mathematical representation, the shape, or representation of the code above. Practical case - The plainest mundane for loop: for (i = 1; k <= n; i ++) { } Let's manually get the exact number of instructions via the elaborated while loop i = 1; // Executes 1 time while ( k <= n ) { // Executes n + 1 times i = i + 1; // Executes 2n times (addition and assignment) } Let's sum up: the plain mundane for loop executes 1 + (n + 1) + 2n = 3n + 2 Therefore, we can represent our for loop code fragment like the foll...
Lire la suite

Understanding Complexity - Urban Traffic VS Highway Traffic

Image
Sometimes, algorithmic complexity, when approached academically, or mathematically, might go astray its literal meaning. Indeed, algorithmic complexity is described using theoretic mathematical expressions, and referred to basically by using Big O notation. As a matter of fact, algorithmic complexity has a picturesque meaning.   Sometimes, a bad algorithm is the one that has a pointless high complexity, and any experienced programmer can easily find room for optimisation. Reducing complexity can sometimes mean that an unnecessary recalculation is repeatedly done. Sometimes, a value should be calculated only by using a formula rather than using (nested) loops etc. A real life situation is traffic in the city versus traffic in the highway. In the city, the distance between home and downtown is 10 km, but it takes me 45 minutes to reach my destination, taking into account traffic lights, intersections, the tramway ... Whereas, the distance between home and a former jo...
Lire la suite