获取最近的未访问点?

时间:2017-08-25 18:53:44

标签: python-3.x pygame

我已经设置了一个包含10个点的pygame窗口,现在我正在尝试将每个点连接到之前没有连接点的最近点。现在,当我运行这一点时,一些点形成闭环,而除了那个应该包含所有点之外不应该存在。

What it does look like

for p in points:
    bestdist=math.inf
    for q in openset:
        if(points[p]!=openset[q]):
            cdist=dist(points[p],openset[q])
            if cdist<bestdist:
                bestdist=cdist
                b=q
    pygame.draw.line(DISPLAYSURF, RED, points[p] ,points[b], 2)
    openset.pop(b,None)
    pygame.display.update()

1 个答案:

答案 0 :(得分:1)

看看这个例子。我只是将最近的点附加到connected_points列表,然后将其从openset中删除。当前点只是最后一点:current_point = connected_points[-1]

import math
import random
import pygame as pg


def dist(p1, p2):
    return math.hypot(p2[0]-p1[0], p2[1]-p1[1])


def main():
    screen = pg.display.set_mode((640, 480))
    clock = pg.time.Clock()
    points = [(random.randrange(640), random.randrange(480))
              for _ in range(10)]
    openset = set(points)
    connected_points = [random.choice(points)]
    openset.remove(connected_points[-1])

    done = False

    while not done:
        for event in pg.event.get():
            if event.type == pg.QUIT:
                done = True

        if openset:
            bestdist = math.inf
            current_point = connected_points[-1]
            for point in openset:
                cdist = dist(current_point, point)
                if cdist < bestdist:
                    bestdist = cdist
                    nearest_point = point

            connected_points.append(nearest_point)
            openset.remove(nearest_point)

        screen.fill((30, 30, 30))
        for p in points:
            pg.draw.circle(screen, (100, 140, 100), p, 5)
        if len(connected_points) >= 2:
            pg.draw.lines(screen, (150, 50, 50), False, connected_points, 2)

        pg.display.flip()
        pg.time.wait(500)
        clock.tick(30)


if __name__ == '__main__':
    pg.init()
    main()
    pg.quit()