{"action":"opened","issue":{"url":"https://api.github.com/repos/YaLTeR/BunnymodXT/issues/14","repository_url":"https://api.github.com/repos/YaLTeR/BunnymodXT","labels_url":"https://api.github.com/repos/YaLTeR/BunnymodXT/issues/14/labels{/name}","comments_url":"https://api.github.com/repos/YaLTeR/BunnymodXT/issues/14/comments","events_url":"https://api.github.com/repos/YaLTeR/BunnymodXT/issues/14/events","html_url":"https://github.com/YaLTeR/BunnymodXT/issues/14","id":172594075,"number":14,"title":"Facility to quickly test save warping","user":{"login":"Matherunner","id":2558060,"avatar_url":"https://avatars.githubusercontent.com/u/2558060?v=3","gravatar_id":"","url":"https://api.github.com/users/Matherunner","html_url":"https://github.com/Matherunner","followers_url":"https://api.github.com/users/Matherunner/followers","following_url":"https://api.github.com/users/Matherunner/following{/other_user}","gists_url":"https://api.github.com/users/Matherunner/gists{/gist_id}","starred_url":"https://api.github.com/users/Matherunner/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/Matherunner/subscriptions","organizations_url":"https://api.github.com/users/Matherunner/orgs","repos_url":"https://api.github.com/users/Matherunner/repos","events_url":"https://api.github.com/users/Matherunner/events{/privacy}","received_events_url":"https://api.github.com/users/Matherunner/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":0,"created_at":"2016-08-23T01:44:54Z","updated_at":"2016-08-23T01:44:54Z","closed_at":null,"body":"Inspired by hlstuff's [SWT](https://github.com/hlstuff/SWT) which is a testing tool to quickly save warp from one map to another without the need to manually specify the intermediate maps and landmarks.\r\n\r\nIn order to figure out the intermediate steps, BXT must have knowledge of an undirected graph linking all maps together. The graph should be stored in a file and specified by\r\n\r\n```\r\nbxt_save_warp_graph filename\r\n```\r\n\r\nThe file should contain an undirected graph with maps as vertices and landmarks associated with the edges. It is yet undecided as to what format the file might take.\r\n\r\nWhen save warping, BXT should by default take the path with the least intermediate steps. However this may not always be desirable. Therefore we can consider adding a command that generates an indexed list of all possible paths sorted by the number of steps.\r\n\r\n```\r\nbxt_save_warp_paths dest\r\n```\r\n\r\nThis should generate a list that looks like this:\r\n\r\n```\r\n[0] map1 -> map2 -> map5\r\n[1] map1 -> map3 -> map4 -> map5\r\n[2] map1 -> map6 -> map7 -> map8 -> map4 -> map5\r\n```\r\n\r\nTo actually save warp, we might have a command that takes the destination map name and an optional index to the path list.\r\n\r\n```\r\nbxt_save_warp dest [index]\r\n```"}}
{"actor":{"display_login":"Matherunner"}}