虫虫首页| 资源下载| 资源专辑| 精品软件
登录| 注册

shoud

  • IMPORTANT YOU shoud LOAD IT DOWN FOR USING

    IMPORTANT YOU shoud LOAD IT DOWN FOR USING

    标签: IMPORTANT shoud USING DOWN

    上传时间: 2016-03-11

    上传用户:王庆才

  • Banker Algorithm You shoud make table by textfile

    Banker Algorithm You shoud make table by textfile

    标签: Algorithm textfile Banker shoud

    上传时间: 2013-12-12

    上传用户:zhaoq123

  • Implemented BFS, DFS and A* To compile this project, use the following command: g++ -o search ma

    Implemented BFS, DFS and A* To compile this project, use the following command: g++ -o search main.cpp Then you can run it: ./search The input is loaded from a input file in.txt Here is the format of the input file: The first line of the input file shoud contain two chars indicate the source and destination city for breadth first and depth first algorithm. The second line of input file shoud be an integer m indicate the number of connections for the map. Following m lines describe the map, each line represents to one connection in this form: dist city1 city2, which means there is a connection between city1 and city2 with the distance dist. The following input are for A* The following line contains two chars indicate the source and destination city for A* algorithm. Then there is an integer h indicate the number of heuristic. The following h lines is in the form: city dist which means the straight-line distance from the city to B is dist.

    标签: Implemented following compile command

    上传时间: 2014-01-01

    上传用户:lhc9102

  • ORG 0000H ljmp star org 0003h ljmp $ star:mov p1,#00h mov p2,#00h mov p3,#00h int: setb ea

    ORG 0000H ljmp star org 0003h ljmp $ star:mov p1,#00h mov p2,#00h mov p3,#00h int: setb ea jiance bit p1.0 shoud bit p1.1 zid bit p1.2 syajin bit p1.3 smanjin bit p1.4 jkaiguan bit p1.5 xianwei bit p1.6 tingzhi bit p3.2 out: yajin bit p2.0 manjin bit p2.1 kuaijin bit p2.2 hanjie bit p2.3程序

    标签: mov ljmp star 00

    上传时间: 2014-01-09

    上传用户:athjac