You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
The purpose of this repository is to study the propagation of worm on the three different types of networks through simulation when no cure (that is, worm defense) is applied. In other words, the worm will continue to spread until no uninfected node remains.
The goal of this project is to implement the Brandes algorithm for calculating betweenness centrality in a graph. The Brandes algorithm is a well-known algorithm for efficiently computing betweenness centrality in large, complex networks.
Consigna y resolución del segundo parcial realizado en Programacion con Objetos II con Python resuelto con el algoritmo de Dijkstra utilizando las bibliotecas networkx y matplotlib
This is a repo for the project "Network Topology of Wikipedia" in the relative subject "Network Modelling & Design" which was taught in the academic calendar year of 2019-20 in the University of Ghent