def f3(analyzer,s1,s2):
cola = qe.newQueue()
qe.enqueue(cola, "Hay " + str(model.numSCC(analyzer)) + " clústeres en el grafo")
if model.sameCC(analyzer,s1,s2)==False:
qe.enqueue(cola, "Las dos estaciones NO pertenecen al mismo clúster")
else:
qe.enqueue(cola, "Las dos estaciones SI pertenecen al mismo clúster")
return cola
def numConnectedComponents(citibike, station1, station2):
"""
RETO4 | REQ1
Llama a la función en el model
que retorna los componentes fuertemente
conectados.
"""
return model.numSCC(citibike['graph']), model.sameCC(
citibike['graph'], station1, station2)
def verticesSCC(analyzer, station1, station2):
"""
"""
present1 = stationInGraph(analyzer, station1)
present2 = stationInGraph(analyzer, station2)
ans = None
if present1 and present2:
ans = model.sameCC(analyzer, station1, station2)
return ans
def getsameCC(analyzer, station1, station2):
"""
Bool que informa si dos estaciones están en el mismo componente conectado.
"""
return model.sameCC(analyzer, station1, station2)
def sameCC(analyzer, station1, station2):
return model.sameCC(analyzer, station1, station2)
def sameCC(sc, station1, station2):
"""
Numero de componentes fuertemente conectados
"""
return model.sameCC(sc, station1, station2)
def searchSCC(analyzer, st1, st2):
return model.sameCC(analyzer, st1, st2)
def sameCC(taxis,station1,station2):
return model.sameCC(taxis,station1,station2)
def sameCC(analyzer, station1, station2):
"""
"""
return model.sameCC(analyzer['components'], station1, station2)
def sameCC(citibike, station1, station2):
return model.sameCC(citibike, station1, station2)
def sameCC(sc, station1, station2):
return model.sameCC(sc, station1, station2)
def retornar_vertices_en_cluster(sc,comp1,comp2):
return m.sameCC(sc,comp1,comp2)
def scc_1(catalog, station1, station2):
return model.sameCC(catalog, station1, station2)