Skip to content

Implementation of algorithms calculating centrality metrics for Undirected Social Networks.

Notifications You must be signed in to change notification settings

nixos89/social-networks-metrics

Repository files navigation

Social Networks Metrics

This repository contains implementation of algorithms calculating centrality metrics for two provided social networks (Karate club and Power Grid) represented as undirected graphs. Implementaion is written in Python 2.7 version and uses iGraph library.

Three main metric algorithms are calculating:

  1. Eigen Vector centrality
  2. Closeness centraility
  3. Betweenness centrality

About

Implementation of algorithms calculating centrality metrics for Undirected Social Networks.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Languages