code required for this algorithm

See more:

C++

C

Procedure tree Projection {
Input: A NNT tree upto depth l
Output: node projected set
1. NPV <- 0
2. for each level li in input
3. for each (u,u')at level li
4. NPV[(li, label(u), label(u'))] <- NPV [li, label(u), label(u'))]+1
5. return NPV
}