def top3lessUsed(analyzer): totaltree = om.newMap(omaptype="RBT", comparefunction=compareIds) pqiterator = it.newIterator(vertexNames(analyzer)) while it.hasNext(pqiterator): vert = int(it.next(pqiterator)) salidas = gr.outdegree(analyzer["graph"], str(vert)) destinos = gr.indegree(analyzer["graph"], str(vert)) usototal = salidas + destinos if not om.contains(totaltree, usototal): om.put(totaltree, usototal, str(vert)) else: A = om.get(totaltree, usototal) B = me.getValue(A) om.put(totaltree, usototal, str(B)+","+str(vert)) estaciones = lt.newList(datastructure="ARRAY_LIST") while lt.size(estaciones) < 3: val = om.get(totaltree, om.minKey(totaltree)) val1 = me.getValue(val) menortotal = val1.split(",") for i in menortotal: if lt.size(estaciones) < 3: K = m.get(analyzer["nameIndex"], i) L = me.getValue(K) lt.addLast(estaciones, L) om.deleteMin(totaltree) return estaciones
def test_remove(tree): tree = om.put(tree, 21, 'book21') tree = om.put(tree, 7, 'book7') tree = om.put(tree, 30, 'book30') tree = om.put(tree, 5, 'book5') tree = om.put(tree, 4, 'book4') tree = om.put(tree, 3, 'book3') tree = om.put(tree, 20, 'book20') tree = om.put(tree, 25, 'book25') tree = om.put(tree, 35, 'book35') tree = om.put(tree, 29, 'book29') tree = om.put(tree, 11, 'book11') tree = om.put(tree, 15, 'book15') tree = om.remove(tree, 21) tree = om.put(tree, 10, 'book10') tree = om.put(tree, 10, 'book10A') assert om.contains(tree, 29) is True assert om.contains(tree, 28) is False assert om.minKey(tree) == 3 assert om.maxKey(tree) == 35 om.deleteMin(tree) assert om.contains(tree, 3) is False
def test_delete_max_min(tree): tree = om.put(tree, 23, 'book21') tree = om.put(tree, 7, 'book7') tree = om.put(tree, 30, 'book30') tree = om.put(tree, 5, 'book5') tree = om.put(tree, 4, 'book4') tree = om.put(tree, 3, 'book3') tree = om.put(tree, 20, 'book20') tree = om.put(tree, 25, 'book25') tree = om.put(tree, 35, 'book35') tree = om.put(tree, 29, 'book29') tree = om.put(tree, 11, 'book11') tree = om.put(tree, 15, 'book15') tree = om.put(tree, 10, 'book10') assert om.contains(tree, 3) is True assert om.size(tree) == 13 om.deleteMin(tree) assert om.contains(tree, 3) is False assert om.size(tree) == 12 assert om.contains(tree, 35) is True assert om.size(tree) == 12 om.deleteMax(tree) assert om.contains(tree, 35) is False assert om.size(tree) == 11