International Academy of Ecology and Environmental Sciences Network Pharmacology 2410-1000 1 3 2016 9 1 How to find cut nodes and bridges in the network? A Matlab program and application in tumor pathways 82-85 EN WenJun Zhang http://www.iaees.org/publications/journals/np/articles/2016-1(3)/find-cut-nodes-and-bridges-in-the-network.pdf> A connected graph X is a block, if and only if for any three vertices u, v and w in X, there exists a path from u to w and the path does not contain v. In present article I present full Matlab codes of the algorithm for finding cut nodes and bridges in the network.