Computational methods for social network analysis

摘要: Search algorithms that have been developed in the discipline computer science can be applied to analysis of social networks. These generally provide two capabilities useful for network analysis: very efficient means “visiting” every node a network, and method generating all possible paths through network. The basic search algorithm is called depth first algorithm. To implement this efficiently requires use data structures not commonly used at present time, singly linked list, doubly list (sparse matrix). This paper describes how based analyzing connectivity We also propose new measures connectivity, these identify structural properties networks capture