Research Article
Detecting Copy Directions among Programs Using Extreme Learning Machines
Algorithm 2
Pruning isolated control dependence subgraphs.
| Input: PDG , pruning threshold ; | | Output: PDG after pruning isolated control dependence subgraphs; | | () Generate control dependence subgraph set in ; | | () foreach control dependence subgraph in do | | () ; | | () foreach statement in do | | () if has dependence relations with statements outside then | | () ; | | () Remove subgraphs in whose number of dependencies are greater than ; | | () ; | | () ; | | () ; | | () foreach subgraph in do | | () if then | | () delete from ; | | () ; | | () ; | | () return ; |
|