Don't know whether it exists
One algorithm would be
- give each way-point(node) the same action
- set some FLAGS/other stuff to signalize that this is a node.
- set one skill to a number of the path ( all nodes of path 1 will have skill1 set to 1,all nodes of path 2 will have skill1 set to 2 )
- give them a node-number (node1 node2) to order them in their paths
- scan the nodes environment for the next higher node of his path, saving this handle in a skill
- saving every first node of a path in an array ( by handle or Entity pointer )
Now you have setup the data structure

each frameyou do:
- start a funktion for each first node giving it a particle funktion as a parameter
this function does:
- make beam to the next node run the same function on the next node

Actually there could be one performance problem:
- I believe that the recursion is quite slow.


Hope this allgorithm is clear.

muffel