Consider a directed graph with V nodes and E edges. The graph is represented by two arrays, source
src[] and destination dest[] each of size E, such that src[i] and dest[i] represent the nodes
connected by edge, i.
How to calculate the maximum indegree(or out degree)?