八数码问题宽度优先搜索(Java实现)

上传者: 38662054 | 上传时间: 2019-12-21 20:49:50 | 文件大小: 29KB | 文件类型: zip
利用Java实现人工智能的八数码问题的宽度优先算法,实现对该问题的解决

文件下载

资源详情

[{"title":"( 19 个子文件 29KB ) 八数码问题宽度优先搜索(Java实现)","children":[{"title":"EightNumPathBFS","children":[{"title":"test","children":null,"spread":false},{"title":"build.xml <span style='color:#111;'> 3.54KB </span>","children":null,"spread":false},{"title":"dist","children":[{"title":"README.TXT <span style='color:#111;'> 1.30KB </span>","children":null,"spread":false},{"title":"EightNumPathBFS.jar <span style='color:#111;'> 9.01KB </span>","children":null,"spread":false}],"spread":true},{"title":"manifest.mf <span style='color:#111;'> 85B </span>","children":null,"spread":false},{"title":"src","children":[{"title":"eightnumpathbfs","children":[{"title":"Node.java <span style='color:#111;'> 345B </span>","children":null,"spread":false},{"title":"EightNumPathBFS.java <span style='color:#111;'> 781B </span>","children":null,"spread":false},{"title":"BFS.java <span style='color:#111;'> 8.82KB </span>","children":null,"spread":false}],"spread":true}],"spread":true},{"title":"nbproject","children":[{"title":"build-impl.xml <span style='color:#111;'> 78.04KB </span>","children":null,"spread":false},{"title":"private","children":[{"title":"private.xml <span style='color:#111;'> 343B </span>","children":null,"spread":false},{"title":"private.properties <span style='color:#111;'> 112B </span>","children":null,"spread":false}],"spread":true},{"title":"project.xml <span style='color:#111;'> 523B </span>","children":null,"spread":false},{"title":"genfiles.properties <span style='color:#111;'> 475B </span>","children":null,"spread":false},{"title":"project.properties <span style='color:#111;'> 2.44KB </span>","children":null,"spread":false}],"spread":true},{"title":"build","children":[{"title":"classes","children":[{"title":".netbeans_automatic_build <span style='color:#111;'> 0B </span>","children":null,"spread":false},{"title":".netbeans_update_resources <span style='color:#111;'> 0B </span>","children":null,"spread":false},{"title":"eightnumpathbfs","children":[{"title":"Node.class <span style='color:#111;'> 352B </span>","children":null,"spread":false},{"title":"BFS.class <span style='color:#111;'> 6.28KB </span>","children":null,"spread":false},{"title":"EightNumPathBFS.class <span style='color:#111;'> 1.08KB </span>","children":null,"spread":false}],"spread":true}],"spread":true},{"title":"empty","children":null,"spread":false},{"title":"built-jar.properties <span style='color:#111;'> 101B </span>","children":null,"spread":false},{"title":"generated-sources","children":[{"title":"ap-source-output","children":null,"spread":false}],"spread":true}],"spread":true}],"spread":true}],"spread":true}]

评论信息

免责申明

【只为小站】的资源来自网友分享,仅供学习研究,请务必在下载后24小时内给予删除,不得用于其他任何用途,否则后果自负。基于互联网的特殊性,【只为小站】 无法对用户传输的作品、信息、内容的权属或合法性、合规性、真实性、科学性、完整权、有效性等进行实质审查;无论 【只为小站】 经营者是否已进行审查,用户均应自行承担因其传输的作品、信息、内容而可能或已经产生的侵权或权属纠纷等法律责任。
本站所有资源不代表本站的观点或立场,基于网友分享,根据中国法律《信息网络传播权保护条例》第二十二条之规定,若资源存在侵权或相关问题请联系本站客服人员,zhiweidada#qq.com,请把#换成@,本站将给予最大的支持与配合,做到及时反馈和处理。关于更多版权及免责申明参见 版权及免责申明