This PR fixes some for loops so that they iterate using size_t instead of int, to match the return type of vector::size(). This would ease a transition towards having graphs with more than 2,147,483,647 elements.
In printList the min/max search is initiated by choosing the first element of the array as the initial value. This means that sentinel values are no longer needed.
Some trailing whitespace is dropped and a stronger check is made on input arguments to the main teexgraph binary.
This PR fixes some for loops so that they iterate using
size_tinstead ofint, to match the return type ofvector::size(). This would ease a transition towards having graphs with more than 2,147,483,647 elements.In
printListthe min/max search is initiated by choosing the first element of the array as the initial value. This means that sentinel values are no longer needed.Some trailing whitespace is dropped and a stronger check is made on input arguments to the main teexgraph binary.