Determine the largest $k$ such that for all competitive graph with $2019$ points, if the difference between in-degree and out-degree of any point is less than or equal to $k$, then this graph is strongly connected.