-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathTest.py
More file actions
133 lines (106 loc) · 2.49 KB
/
Test.py
File metadata and controls
133 lines (106 loc) · 2.49 KB
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
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
import sqlite3
from random import *
import math
from sets import Set
con = sqlite3.connect("GraphsBase.db")
cur = con.cursor();
cur.execute('SELECT N, M, Delta FROM GraphBig ')
Line2 = cur.fetchall()
for j in Line2:
print j
print "Nucleo"
cur.execute('SELECT N, M, Edges,ciclico FROM NucleoBig')
Line2 = cur.fetchall()
for j in Line2:
print j
'''
print "Possiveis Overfulll"
cur.execute('SELECT N, Delta FROM GraphBig')
N=cur.fetchone()[0]
i=cur.fetchone()[1]
cur.execute('SELECT N, M FROM GraphBig WHERE M>= ?', (( int(N/2)*i +1) ,))
Line2 = cur.fetchall()
for j in Line2:
print j
'''
'''
for i in xrange(2, 14):
cur.execute('SELECT MAX(M) FROM Graph WHERE N==?', (i,))
print str(i) +" "+ str(cur.fetchone()[0])
for i in xrange(2, 14):
cur.execute('SELECT * FROM Graph WHERE N==6 and M==12')
print str(i) +" "+ str(cur.fetchone()[0])
cur.execute('SELECT * FROM Graph WHERE N==6 and M==12 and NUCLEO==1751')
allLine=cur.fetchall()
for i in allLine:
print i
print "Nucelo"
cur.execute('SELECT * FROM NUCLEO WHERE id==1751')
allLine=cur.fetchall()
for i in allLine:
print i
'''
'''cur.execute('SELECT COUNT(*) FROM Graph')
print cur.fetchone()[0]
'''
#all_rows = cur.fetchall()
#for i in all_rows:
# print i
#print "Nucleo"
#cur.execute('''SELECT * FROM Nucleo''')
#all_rows = cur.fetchall()
#for i in all_rows:
# print i
'''
def ListaAdj(Edg, N): #gera a matriz de adj do Grafo
# print Edg + "Arestas "+ str(N)
if N <= 2 :
if (len(Edg)>2):
return [[1], [0]]
else:
return None
L=list([])
for i in xrange(0, N): #cria uma lista de conjuntos que serao as linhas
L.append(list([]))
divide = Edg.split(' ');
cont=0
anterior=-1
for j in divide:
if str(j)!= "":
if (cont % 2==0):
anterior = j
else:
atual=j
e1 = int (anterior)
e2 = int (atual)
print str(e1)+" ERS "+str(e2)
L[e1].append(e2)
L[e2].append(e1)
print j+" J"
cont+=1
return L
def FindNucleo( adj, delta):
Nl=list([])
edg=""
Nm=0
flag=True
for i in xrange(0, N):
if len(adj[i])==delta:
Nl.append(i)
for j in adj[i]:
if (i > j and len(adj[i])==delta):
if flag:
flag=False
edg=str(i)+" "+str(j)
else:
edg+=" "+ str(i)+" "+str(j)
Nm+=1
Nn=len(Nl)
NAdj=ListaAdj(edg, self.N)
for j in NAdj:
print j
L=ListaAdj("0 2 0 5 0 6 1 3 1 5 1 6 2 3 3 5 3 6 4 5 4 6", 7)
FindNucleo(L, 3)
for i in L:
print i
'''