CCRP ( ) 1. { 2. G = (V, E) where V represents the collection of nodes and E represents the connection among the nodes. 3. V = N = {N1, N2, N3, ∙∙∙, Nn} where 4. L = {L1, L2, ∙∙∙, LL} where, the set of levels in the network 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 Li 9. end K 10. end J 11. end I 12. // input : path P 13. // output: Nodal-nodes {Nn1, Nn2, ∙∙∙, Nmn} 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 L1, L2, ∙∙∙, Ln 17. Check_Point (path P) 18. CAND_IDS (path P) 19. } |