Added less than operation on GraphEdge class.

Since the implementation of the Kruskal algorithm to find the minimum spanning tree requires that all edges of the graph be ordered, the 'less-than' operator will be overloaded.
The comparison consists on a simple comparison between both edges' weights.