The special class of networks are presented. Based on unreachable parts of subgraphs the overlappingly decomposed networks are defined. The special decomposition scheme of those networks is applicated for shortest path problem, dynamic programming and synthetic neural nets architecture.