
Home

Network Pharmacology, 2016, 1(3): 82-85
[XML] [EndNote] [RefManager] [BibTex] [

Full PDF (63K)] [Comment/Review Article]

Article

How to find cut nodes and bridges in the network? A Matlab program and application in tumor pathways

WenJun Zhang
School of Life Sciences, Sun Yat-sen University, Guangzhou 510275, China; International Academy of Ecology and Environmental Sciences, Hong Kong

Received 9 December 2015;Accepted 7 January 2016;Published online 1 September 2016
IAEES

Abstract
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.

Keywords network;cut nodes;bridges;Matlab.

International Academy of Ecology and Environmental Sciences. E-mail: office@iaees.org
Copyright © 2009-2024 International Academy of Ecology and Environmental Sciences. All rights reserved.
Web administrator: office@iaees.org, website@iaees.org; Last modified: 2024/5/5

Translate page to: