Research Article
Measuring Component Importance for Network System Using Cellular Automata
Algorithm 2
NEA.
| Input: Network with source node and terminal node ; | |
| Ouput: and ; | |
| Use DB-CA to decompose network ; | |
| Let ; | |
| Assume and ; | |
| Let for any in ; | |
| for any path in , do | |
| ,where ; | |
| if i == k, then | |
| put path into ; | |
| end if | |
| end for | |
| Let , | |
| if there are any path not been precessed then | |
| go to ; | |
| end if | |
| return and ; | |
| for any path in , do | |
| while do | |
| ,where ; | |
| end while | |
| while do | |
| ; | |
| if then | |
| ; | |
| else | |
| ; | |
| end if | |
| end while | |
| end for | |
| Let | |
| if there are any path in not given processed then | |
| go to | |
| end if | |
| return and . |