Is and algorithms like it are a bit above beginners because they require understanding of some higher concepts .
recursive function is a bit hard to grab. You can start by googling 'c recursive function" -- I'll also post a link to a video in a edit that helps understand this..
The function basically takes a start and end point then test every node combination between them(Almost more below) at once. It then collects all the shortest 2- point-nodes in the collection of all nodes between. If you know a start and end then you can test the lengths between 2-point-node-sets for shortest till you've found all node on the shortest path.
It's hard to explain and from people to grasp because it's not simple in concept. It's absolutely not expected for beginners to get this, it's just supposed to work till you learn enough to understand it.
Watch video
https://mva.microsoft.com/en-US/training...nHKy_3404984382Recursion starts at time 1:15:40 or So...
The whole core programming section of video is good to understand, but quite basic and boring if your experienced you'll know all this..
