eng International Academy of Ecology and Environmental Sciences Network Pharmacology 2410-1000 2016-9-1 1 3 82 85 2 article WenJun Zhang 1 2 School of Life Sciences, Sun Yat-sen University, Guangzhou 510275, China; International Academy of Ecology and Environmental Sciences, Hong Kong 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. http://www.iaees.org/publications/journals/np/articles/2016-1(3)/find-cut-nodes-and-bridges-in-the-network.pdf network cut nodes bridges Matlab