def testRoundForNode_part1(self): adjacencyMatrix = [[0, 1, 1, 1], [1, 0, 1, 1], [1, 1, 0, 1], [1, 1, 1, 0]] # tworzenie sieci network = Network(adjacencyMatrix) alg = LogStar(network) nodes = network.ndList # 1 - sprawdzenie czy inicjalizacja sie powiodla network.algorithm = alg for node in nodes: alg.initiateNode(node) for node in nodes: self.failUnless(node.memory['state'] == 'competitor') self.failUnless(node.memory['activity'] == 'initiate loop')
from algorithm.log_star_MIS import LogStar from network.network import Network from graph_tool.all import * from graph_generators.n_unit_disk_graph import getUnitDiskGraph n = 30 adjacencyMatrix = getUnitDiskGraph(n) # tworzenie sieci network = Network(adjacencyMatrix) alg = LogStar() network.algorithm = alg alg.network = network nodes = network.ndList for node in nodes: alg.initiateNode(node) network.executeAlgorithm() # czesc rysujaca g = Graph(directed=False) # dodawanie wezlow - indeksowanie bedzie sie zgadzalo for node in nodes: g.add_vertex() # dodawanie krawedzi - tu trzeba isc po macierzy incydencji