|
21 | 21 | '3212195884', '3212195874', '3212195866', '3212195869', '3212195878', |
22 | 22 | '3212195882', '3212195889', '3212195895', '3212195893', '3212195896' |
23 | 23 | ) |
24 | | -# bounds = [11.089153289794922, 4.593878359460639, 11.418743133544922, 4.759664350520704] |
25 | | -# bounds = [28.212890625, -1.8261677821806805, 33.486328125, 0.8349313860427184] |
26 | | -bounds = [15.496902465820312, -1.4843615162701949, 16.375808715820312, -1.0113763068489454] # the short line in the middle of africa |
| 24 | +bounds = [10.39529800415039, 4.050234320898018, 10.50516128540039, 4.109221809610561] # parallel lines |
| 25 | +# bounds = [15.496902465820312, -1.4843615162701949, 16.375808715820312, -1.0113763068489454] # the short line in the middle of africa |
27 | 26 | clusterWrapper = ClusterWrapper(cur, bounds) |
28 | 27 | clusters = clusterWrapper.getClusters() |
29 | 28 |
|
|
39 | 38 | processing_node = farthest_nodes[0] |
40 | 39 | processed_nodes = [] |
41 | 40 | processed_nodes.append(processing_node) |
| 41 | +ignored_nodes = [] # nodes are ignored if there are too close to a node |
42 | 42 |
|
43 | 43 | is_complete = False |
44 | 44 |
|
45 | 45 | while is_complete == False: |
46 | 46 | # print(processed_nodes) |
47 | 47 | # print "processing - ", |
48 | 48 | # print(processing_node) |
| 49 | + # procesed nodes minus the all nodes |
49 | 50 | unprocessed_nodes = tuple(set(tuple(processed_nodes)) ^ set(nodes_osmids)) |
| 51 | + |
| 52 | + # unprocessed nodes minus the ignored node. |
| 53 | + unprocessed_nodes = tuple(set(unprocessed_nodes) ^ set(tuple(ignored_nodes))) |
50 | 54 | closest_node = None |
51 | 55 |
|
52 | 56 | if len(unprocessed_nodes) > 0: |
53 | | - closest_nodes = NodesWrapper(cur, []).get_closest_nodes_to( |
| 57 | + nodes_around = NodesWrapper(cur, []).get_closest_nodes_to( |
54 | 58 | processing_node, |
55 | 59 | unprocessed_nodes |
56 | 60 | ) |
57 | | - print(closest_nodes) |
| 61 | + |
| 62 | + ignored_nodes = ignored_nodes + nodes_around['too_close_node_osmids'] |
| 63 | + closest_node = nodes_around['closest_node_osmid'] |
58 | 64 | else: |
59 | 65 | is_complete = True |
60 | 66 | continue |
61 | 67 |
|
62 | | - if len(closest_nodes) > 0: |
63 | | - closest_node = closest_nodes[0] # There are already ordered by distance |
64 | | - |
65 | | - if closest_node is not None and len(closest_node) > 0: |
| 68 | + if closest_node is not None: |
66 | 69 | print "Closest is - ", |
67 | | - print(closest_node[1]) |
68 | | - processing_node = closest_node[1] |
| 70 | + print(closest_node) |
| 71 | + processing_node = closest_node |
69 | 72 | processed_nodes.append(processing_node) |
70 | 73 | else: |
71 | 74 | print("\n*********** IS COMPLETE **************\n") |
|
0 commit comments