Doubt on Graph on DFS The maximum number of edges possible in an undirected graph with 5 nodes, when DFS call made on any random node in the graph result stack size 5 i.e. 5 function call present in stack simultaneously are ____________________



How graph edges can be converted to a function call ? Is that mean here we have to do a recursive call. I am not getting clear, what is function call here. Plz help
Graph edges are not "converted to function calls". DFS is a recursive function. When you call DFS on some start node, it looks at the adjacent vertices (vertices which are connected to this node via an edge) and recursively calls itself on one of them. 
But since each node is only visited once in a DFS, the maximum stack size cannot be greater than the number of nodes.