def correctMatrixForPoint(adjacencyMatrix, points, pointIndex, radius, n):
""" Metoda poprawia macierz sasiedztwa dla jednego punktu
Argumenty:
adjacencyMatrix - macierz sasiedztwa
points - lista punktow
pointIndex - indeks punktu dla ktorego nanoszone sa poprawki
radius - promien w zasiegu ktorego wierzcholek widzi swoich sasiadow
n - ilosc wierzcholkow w grafie
"""
# 1 - wymazywanie dotychczasowych sasiadow z punktu
# 2 - wymazywanie informacji o sasiedztwie z punktem
# 3 - obliczanie nowych sasiadow
for i in xrange(n):
# zawor bezpieczenstwa
if i == pointIndex:
continue
dist = getDist(points[i], points[pointIndex])
if dist <= radius:
adjacencyMatrix[i][pointIndex] = 1
adjacencyMatrix[pointIndex][i] = 1
else:
adjacencyMatrix[i][pointIndex] = 0
adjacencyMatrix[pointIndex][i] = 0
return adjacencyMatrix
def runPackageManagerInstall(package, *args):
dist = utils.getDist()
if dist == sad._FEDORA_DIST_NAME_:
_executeCommand(
sad._LINUX_SUDO_COMMAND_, sad._FEDORA_PACKAGE_MANADER_COMMAND_,
[sad._LINUX_PACKAGE_MANAGER_INSTALL_OPTION, package] + list(args))
if dist == sad._UBUNTU_DIST_NAME_:
_executeCommand(
sad._LINUX_SUDO_COMMAND_, sad._UBUNTU_PACKAGE_MANAGER_COMMAND_,
[sad._LINUX_PACKAGE_MANAGER_INSTALL_OPTION, package] + list(args))
def distance_to(self, p):
bus_id = 'test_bus'
traci.vehicle.add(vehID=bus_id,
typeID="BUS_S",
routeID="",
depart=0,
departPos=0,
departSpeed=0,
departLane=0,
personCapacity=4)
traci.vehicle.setRoute(bus_id, [self.get_edge()])
traci.vehicle.changeTarget(bus_id, p.edge_from)
dist = utils.getDist(traci.vehicle.getRoute(bus_id))
traci.vehicle.remove(vehID=bus_id)
return dist
def constructNewMatrix(points, radius, n):
""" Funkcja konstruuje nowa macierz sasiedztwa dla grafu unit disk.
Macierz jest poprawiana dopoki graf nie bedzie spojny.
"""
adjacencyMatrix = [[0 for i in xrange(n)] for j in xrange(n)]
for i in xrange(n-1):
for j in xrange(i+1, n):
# zawor bezpieczenstwa
if i == j:
continue
dist = getDist(points[i], points[j])
if dist <= radius:
adjacencyMatrix[i][j] = 1
adjacencyMatrix[j][i] = 1
return adjacencyMatrix
