算法图解第七章练习题

最新推荐文章于 2025-12-17 01:00:00 发布

原创最新推荐文章于 2025-12-17 01:00:00 发布 · 259 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

算法图解

这篇博客主要探讨了《算法图解》第七章的练习题，涉及到Python编程和算法应用。通过A部分和B部分的详细阐述，引导读者自行研究不同字典的特性与操作。

A

#
create = {}
create["A"] = {}
create["A"]["B"] = 5
create["A"]["C"] = 2

create["B"] = {}
create["B"]["D"] = 4
create["B"]["E"] = 2

create["C"] = {}
create["C"]["B"] = 8
create["C"]["E"] = 7

create["D"] = {}
create["D"]["E"] = 6
create["D"]["F"] = 3

create["E"] = {}
create["E"]["F"] = 1

create["F"] = {}

#
inf = float("inf")
costs = {}
costs["B"] = 5
costs["C"] = 2
costs["D"] = inf
costs["E"] = inf
costs["F"] = inf

#
relation = {}
relation["B"] = ["A","C"]
relation["C"] = "A"
relation["D"] = "B"
relation["E"] = ["B","C","D"]
relation["F"] = ""

processed = []

def getlowcost(list):
    lowest_cost = float("inf")
    lowest_node = None
    for node in costs:
        #print(node)
        cost = costs[node]
        #print(cost)
        if cost < lowest_cost and node not in processed:
            lowest_cost = cost
            lowest_node = node
    return lowest_node

node = getlowcost(costs)

while node:
    cost = costs[node]
    neib = create[node]
    #print(neib)
    for i in neib.keys():
        #print(i)
        newcost = cost + neib[i]
        #print(neib[i])
        if costs[i] > newcost:
            costs[i] = newcost
            relation[i] = node
    processed.append(node)
    node = getlowcost(costs)

print(costs)

B

#
create = {}
create["start"] = {}
create["start"]["A"] = 10

create["A"] = {}
create["A"]["C"] = 20

create["B"] = {}
create["B"]["A"] = 1

create["C"] = {}
create["C"]["B"] = 1
create["C"]["end"] = 30

create["end"] = {}

#
inf = float("inf")
costs = {}
costs["A"] = 10
costs["B"] = inf
costs["C"] = inf
costs["end"] = inf

#
relation = {}
relation["A"] = ["start","B"]
relation["B"] = ""
relation["C"] = "A"
relation["end"] = "C"
#
processed = []

def getlowcost(costs):
    lowest_cost = inf
    lowest_node = None
    for node in costs:
        cost = costs[node]
        if cost < lowest_cost and node not in processed:
            lowest_cost = cost
            lowest_node = node
    return lowest_node

node = getlowcost(costs)
while node:
    cost = costs[node]
    neib = create[node]
    for i in neib.keys():
        newcost = cost + neib[i]
        if costs[i] > newcost:
            costs[i] = newcost
            relation[i] = node
    processed.append(node)
    node = getlowcost(costs)

print(costs)