Ian Gulliver
|
3f015a3540
|
Encourage link merging
|
2019-07-09 05:55:04 +00:00 |
|
Ian Gulliver
|
d4f90eb91d
|
Allow lines to cross but not travel together
|
2019-07-09 05:24:11 +00:00 |
|
Ian Gulliver
|
91afac2ecc
|
Allow lines to or from the same node to overlap
|
2019-07-09 04:57:52 +00:00 |
|
Ian Gulliver
|
81540590ef
|
Remove some cruft weights that aren't providing value
|
2019-07-09 04:29:02 +00:00 |
|
Ian Gulliver
|
a68471d1da
|
Draw directional arrows
|
2019-07-09 04:19:09 +00:00 |
|
Ian Gulliver
|
d2ec4d45a2
|
Add TODO
|
2019-07-08 02:24:23 +00:00 |
|
Ian Gulliver
|
d3374af802
|
Add cost to diagonals, actually count cost for the midpoint
|
2019-07-07 23:39:29 +00:00 |
|
Ian Gulliver
|
119f879479
|
Very fast bidirectional search for links
|
2019-07-07 22:47:23 +00:00 |
|
Ian Gulliver
|
6790bf06fd
|
Just stop when we reach the goal, since we always find a min-cost path
|
2019-07-07 22:32:35 +00:00 |
|
Ian Gulliver
|
d0856de6ef
|
Remove getDirect()
|
2019-07-07 22:30:49 +00:00 |
|
Ian Gulliver
|
975f40b1c4
|
Switch from sorted array to minheap
|
2019-07-07 22:28:38 +00:00 |
|
Ian Gulliver
|
39a3d20e73
|
Util cleanup
|
2019-07-07 21:47:16 +00:00 |
|
Ian Gulliver
|
7a2ac17344
|
Simulated minheap
|
2019-07-07 21:45:15 +00:00 |
|
Ian Gulliver
|
9d84177b78
|
Fix todo
|
2019-07-07 21:36:39 +00:00 |
|
Ian Gulliver
|
ab28ef5909
|
Penalize link lines crossing over each other
|
2019-07-07 21:27:55 +00:00 |
|
Ian Gulliver
|
d53e3260a8
|
Add LayoutLink, start with BFS for line drawing
|
2019-07-06 20:59:27 +00:00 |
|