Rank metric codes are classes of linear codes which are used in network coding and cryptography. Example of invariants of rank metric codes are the generalized rank weights. These generalized rank weights are invariant under equivalence. They can be used to check whether two different codes are equivalent or not. The computation of generalized weight of rank metric codes is in general a difficult problem. For this reason, we need powerful computers to compute the generalized rank weights for relatively large rank metric codes.