CCRP ( ) 1. { 2. G = (V, E) where V represents the collection of nodes and E represents the connection among the nodes. 3. V = N = {N 4. L = {L 5. for I = 1 to n 6. for J = 1 to L 7. for K = 1 to n/L 8. //n/L number of nodes are placed in layer L 9. end K 10. end J 11. end I 12. // input : path P 13. // output: Nodal-nodes {N 14. // Prerequisite : path 15. // Initial condition: Network with layers separated 16. // exit criteria: graph G connected graph or all nodal nodes are identified in layer L 17. Check_Point (path P) 18. CAND_IDS (path P) 19. } |