Abstract
Graph analysis refers to the set of algorithms for analyzing properties of a graph. The main algorithms for graph analysis and traversal are introduced in this chapter. We start by discussing graph traversal, i.e., the problem of visiting the nodes of a graph. Many algorithms of graph analysis are based on a extension or modification of graph traversal algorithms. We then discuss the ways to find a shortest path among nodes in a graph. We also consider the compression of graphs through power graph analysis and the discovery of communities (i.e., a subgraph having some given properties). Node centrality measures, used for finding vital nodes are also discussed. We demonstrate the use of various graph traversal and analysis methods using R libraries.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
