Combining swaps and nodes weighting in an adaptive greedy approach for the maximum clique problem