Python icの例

コード例 #1

ファイル: WattsStrogatz.py プロジェクト: indiependente/Social-Networks-Structure

def independent_cascade(graph, seed, centrality):
    adopters, haters, steps = ic(g, seed)
    # print 'Independent Cascade Model: TOP %d %s' % (len(seed), centrality)
    # print '\tFinal Adopters:\t', len(adopters)
    # print '\tFinal Haters:\t', len(haters)
    # print '\t# Iterations:\t', steps
    return len(adopters)

コード例 #2

ファイル: cascade_wv.py プロジェクト: indiependente/Social-Networks-Structure

def independent_cascade(graph, seed, centrality):
    adopters, haters, steps = ic(g, seed)
    # print 'Independent Cascade Model: TOP %d %s' % (len(seed), centrality)
    # print '\tFinal Adopters:\t', len(adopters)
    # print '\tFinal Haters:\t', len(haters)
    # print '\t# Iterations:\t', steps
    return len(adopters)

コード例 #3

ファイル: testcascade.py プロジェクト: indiependente/Social-Networks-Structure

#!/usr/bin/python
import sys
from lesson4 import topk, lastk
from dgraph import readGraph
from dgraph import Page_Rank as pr
from dgraph import Independent_Cascade as ic

seed = int(sys.argv[1])

g = readGraph('wiki-Vote.txt')

pagerank, iterations, err = pr(g, alpha=1.0e-5, eps=1.0e-6) # alpha = 0.00001
# print pagerank
print 'Page Rank. %s iterations. %s accuracy' % (iterations, err)
top = [a for a,b in topk(pagerank, seed)]
last = [a for a,b in lastk(pagerank, seed)]
print 'Top', seed
print [(u, pagerank[u]) for u in top]
print 'Last', seed
print [(u, pagerank[u]) for u in last]
adopters, haters, steps = ic(g, top)
print 'Independent Cascade Model: TOP', seed
print 'Final Adopters:', len(adopters)
print 'Final Haters:', len(haters)
print '# Iterations:', steps
adopters, haters, steps = ic(g, last)
print 'Independent Cascade Model: LAST', seed
print 'Final Adopters:', len(adopters)
print 'Final Haters:', len(haters)
print '# Iterations:', steps

コード例 #4

ファイル: testcascade.py プロジェクト: indiependente/Social-Networks-Structure

#!/usr/bin/python
import sys
from lesson4 import topk, lastk
from dgraph import readGraph
from dgraph import Page_Rank as pr
from dgraph import Independent_Cascade as ic

seed = int(sys.argv[1])

g = readGraph('wiki-Vote.txt')

pagerank, iterations, err = pr(g, alpha=1.0e-5, eps=1.0e-6)  # alpha = 0.00001
# print pagerank
print 'Page Rank. %s iterations. %s accuracy' % (iterations, err)
top = [a for a, b in topk(pagerank, seed)]
last = [a for a, b in lastk(pagerank, seed)]
print 'Top', seed
print[(u, pagerank[u]) for u in top]
print 'Last', seed
print[(u, pagerank[u]) for u in last]
adopters, haters, steps = ic(g, top)
print 'Independent Cascade Model: TOP', seed
print 'Final Adopters:', len(adopters)
print 'Final Haters:', len(haters)
print '# Iterations:', steps
adopters, haters, steps = ic(g, last)
print 'Independent Cascade Model: LAST', seed
print 'Final Adopters:', len(adopters)
print 'Final Haters:', len(haters)
print '# Iterations:', steps