Sample Complexity Bounds for Recurrent Neural Networks with Application to Combinatorial Graph Problems