Implementation of second example of dinamic programming.

Longest increasing subsequences. Uses 3rd party library Networkx for the
sake of the programmer.