NemoMapPy/DriverForGraphProcessor.py at master · zicanl/NemoMapPy · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
import time
from GraphProcessor import GraphProcessor
from Utility import Utility
from RandomGraphGenerator import RandomGraphGenerator
from statistics import pstdev

'''Get File names and see if they can be opened'''
inputName = input("Input Graph: ")
queryName = input("Query Graph: ")

goodInput = True
try:
    open(inputName, "r")
except IOError:
    print("Input File Error - check spelling and that file exists")
    goodInput = False
try:
    open(queryName, "r")
except IOError:
    print("Query File Error -  check spelling and that file exists")
    goodInput = False

if goodInput:
    '''Create Graphs'''
    myGP = GraphProcessor()
    inputGraph = myGP.loadGraph(inputName, directed=True)
    queryGraph = myGP.loadGraph(queryName, directed=True)
    myUtility = Utility()
    randomGenerator = RandomGraphGenerator()
    """
    main output
    print stats
    """
    print("\n")
    print("Input Graph: Nodes - %d; Edges - %d" % (inputGraph.getNumberofVertices(), inputGraph.getNumberofEdges()))
    print("Query Graph: Nodes - %d; Edges - %d" % (queryGraph.getNumberofVertices(), queryGraph.getNumberofEdges()))

    print("\nQuery Graph (sub-graph) Edges: ")
    for item in queryGraph.getEdgeList():
        print(item)

    h = queryGraph.getNodesSortedByDegree(0)
    h1 = h[-1]
    print("\nH node = [ %d ]" % h1)

    '''run the nemomap alg'''
    timeStart = time.time()
    totalMappings = myUtility.algorithm2_modified(queryGraph, inputGraph, h1, 0)

    print("\nMapping: %d" % totalMappings)

    zScore = None
    pValue = None
    countN = 0
    randomMappingList = []
    numberOfIterations = 1
    for i in range(numberOfIterations):
        randomGraph = randomGenerator.generate(inputGraph)
        for edge in randomGraph.edgeList:
            print(edge[0], edge[1])
        randomMappings = myUtility.algorithm2_modified(queryGraph, randomGraph,
                                                       queryGraph.getNodesSortedByDegree(0)[-1], 1)
        randomMappingList.append(randomMappings)

        if randomMappings >= totalMappings:
            countN += 1
    if numberOfIterations > 0:
        print("\ncountN: ", countN)
        pValue = countN / numberOfIterations

        stdFRm = pstdev(randomMappingList)
        avgFRm = sum(randomMappingList) / (len(randomMappingList))
        print("\nMapping: {}".format(totalMappings))
        print("Average of Mapping in Random Graphs: {}".format(avgFRm))
        print("Standard Deviation of Mapping in Random Graphs: {}".format(stdFRm))
        if stdFRm == 0.0:
            zScore = "undefined"
        else:
            zScore = (totalMappings - avgFRm) / stdFRm
        timeEnd = time.time()

        print("\nP value: ", pValue)
        print("Z Score: ", zScore)
        print("Time taken: %s seconds" % (timeEnd - timeStart))


else:
    exit()