Centrality in a Social Network

Problem Statement:

Given a graph representing nodes and their relationship with one other find the most optimal node(s) to target in order to spread a message or post with maximal reach, with minimal transfers.

Name		Name	Last commit message	Last commit date
Latest commit History 4 Commits
Perf Graphs		Perf Graphs
external		external
facebook		facebook
munkres		munkres
qpbo		qpbo
results		results
temp_output		temp_output
Makefile		Makefile
Makefile~		Makefile~
analysis		analysis
analysis.cpp		analysis.cpp
cluster		cluster
cluster.cpp		cluster.cpp
cluster.hpp		cluster.hpp
cluster.o		cluster.o
cluster.py		cluster.py
cluster1		cluster1
cluster2		cluster2
cluster3		cluster3
dryrun.py		dryrun.py
hops		hops
hops.exe		hops.exe
hopsperf.cpp		hopsperf.cpp
hopsperf.cpp~		hopsperf.cpp~
hopsperf.exe		hopsperf.exe
hopsperf.o		hopsperf.o
ideas.txt		ideas.txt
ideas.txt~		ideas.txt~
main.cpp		main.cpp
main.py		main.py
output.edges		output.edges
output_graph.png		output_graph.png
readme.md		readme.md
result.out		result.out
results.out		results.out
results.out_temp		results.out_temp
results.out~		results.out~
results.zip		results.zip
spanning		spanning
spanning.cpp		spanning.cpp
spantree.py		spantree.py
temp.out		temp.out
util.cpp		util.cpp
util.hpp		util.hpp
util.o		util.o

ayushdce11/Centrality-in-a-Social-Network

Folders and files

Latest commit

History

Repository files navigation

Centrality in a Social Network

Problem Statement:

About

Resources

Stars

Watchers

Forks

Languages