登录
首页 » Visual C++ » MyGPS

MyGPS

于 2015-11-12 发布 文件大小:1467KB
0 213
下载积分: 1 下载次数: 3
我要下载

代码说明：

  1>实现可以随意浏览任一景点的介绍。（功能一） 2>可以给出任意两个景点的最短距离及其路线。（功能二） 3>可以查看任一景点热度，并可以对对所有景点热度（访问次数）进行排序。（功能三） 4>每个景点相关内容从文件读取，实现对文件操作的练习。 (1> implementations can feel free to browse introduce 任一景 points. (Function a) 2> You can give the shortest distance and route between any two attractions. (Function b) 3> You can view Renyi Jing point heat, and heat can all attractions (visits) to be sorted. (Function c) 4> each spot related content file reading, to achieve the file operations exercises.)

文件列表：

MyGPS
.....\MyGPS.sln,1239,2014-12-24
.....\MyGPS2
.....\......\count.txt,99,2015-01-07
.....\......\Debug
.....\......\.....\CL.read.1.tlog,5370,2014-12-24
.....\......\.....\CL.write.1.tlog,378,2014-12-24
.....\......\.....\link-cvtres.read.1.tlog,2,2014-12-24
.....\......\.....\link-cvtres.write.1.tlog,2,2014-12-24
.....\......\.....\link.6836-cvtres.read.1.tlog,2,2014-12-24
.....\......\.....\link.6836-cvtres.write.1.tlog,2,2014-12-24
.....\......\.....\link.6836.read.1.tlog,2,2014-12-24
.....\......\.....\link.6836.write.1.tlog,2,2014-12-24
.....\......\.....\link.read.1.tlog,3180,2014-12-24
.....\......\.....\link.write.1.tlog,830,2014-12-24
.....\......\.....\Main.obj,268295,2014-12-24
.....\......\.....\mt.read.1.tlog,384,2014-12-24
.....\......\.....\mt.write.1.tlog,342,2014-12-24
.....\......\.....\MyGPS2.Build.CppClean.log,3108,2014-12-24
.....\......\.....\MyGPS2.exe.embed.manifest,406,2014-12-24
.....\......\.....\MyGPS2.exe.embed.manifest.res,472,2014-12-24
.....\......\.....\MyGPS2.exe.intermediate.manifest,381,2014-12-24
.....\......\.....\MyGPS2.lastbuildstate,112,2014-12-24
.....\......\.....\MyGPS2.log,3644,2014-12-24
.....\......\.....\MyGPS2_manifest.rc,202,2014-12-24
.....\......\.....\rc.read.1.tlog,518,2014-12-24
.....\......\.....\rc.write.1.tlog,322,2014-12-24
.....\......\.....\vc100.idb,207872,2014-12-24
.....\......\.....\vc100.pdb,241664,2014-12-24
.....\......\Main.cpp,10518,2015-01-07
.....\......\map.txt,2290,2014-12-18
.....\......\MyGPS2.vcxproj,7669,2014-12-24
.....\......\MyGPS2.vcxproj.filters,942,2014-12-17
.....\......\MyGPS2.vcxproj.user,143,2014-12-17
.....\......\MyGPS—Map.docx,128393,2014-12-19
.....\......\MyGPS—Map.pdf,168355,2014-12-19

.....\......\x64
.....\......\...\Debug
.....\......\...\.....\CL.read.1.tlog,22954,2015-01-07
.....\......\...\.....\CL.write.1.tlog,532,2015-01-07
.....\......\...\.....\link-cvtres.read.1.tlog,2,2015-01-07
.....\......\...\.....\link-cvtres.write.1.tlog,2,2015-01-07
.....\......\...\.....\link.5860-cvtres.read.1.tlog,2,2015-01-07
.....\......\...\.....\link.5860-cvtres.write.1.tlog,2,2015-01-07
.....\......\...\.....\link.5860.read.1.tlog,2,2015-01-07
.....\......\...\.....\link.5860.write.1.tlog,2,2015-01-07
.....\......\...\.....\link.read.1.tlog,3796,2015-01-07
.....\......\...\.....\link.write.1.tlog,1154,2015-01-07
.....\......\...\.....\Main.obj,380673,2015-01-07
.....\......\...\.....\mt.read.1.tlog,654,2015-01-07
.....\......\...\.....\mt.write.1.tlog,450,2015-01-07
.....\......\...\.....\MyGPS2.Build.CppClean.log,4368,2015-01-07
.....\......\...\.....\MyGPS2.exe.embed.manifest,406,2015-01-07
.....\......\...\.....\MyGPS2.exe.embed.manifest.res,472,2015-01-07
.....\......\...\.....\MyGPS2.exe.intermediate.manifest,381,2015-01-07
.....\......\...\.....\MyGPS2.lastbuildstate,151,2015-01-07
.....\......\...\.....\MyGPS2.log,2840,2015-01-07
.....\......\...\.....\MyGPS2_manifest.rc,212,2015-01-07
.....\......\...\.....\rc.read.1.tlog,626,2015-01-07
.....\......\...\.....\rc.write.1.tlog,430,2015-01-07
.....\......\...\.....\vc100.idb,748544,2015-01-07
.....\......\...\.....\vc100.pdb,643072,2015-01-07
.....\x64
.....\...\Debug
.....\...\.....\count.txt,100,2014-12-24
.....\...\.....\map.txt,2290,2014-12-18
.....\...\.....\MyGPS2.exe,128512,2015-01-07
.....\...\.....\MyGPS2.ilk,891580,2015-01-07
.....\...\.....\MyGPS2.pdb,1395712,2015-01-07

下载说明：请别用迅雷下载，失败请重下，重下不扣分！

发表评论

0 个回复

  • BDX
    设计、编写和调试面向对象C++程序，实现任意两个同类数据比大小 的通用函数（模板），涵盖普通数值型数据之间的比较、两个字符串之间的比较 （按字典序）、两个复数之间的比较（按模大小）等，并通过主函数加以调用和 测试。(Design, writing and debugging of object-oriented C++ procedures to achieve similar data than the size of any two generic functions (template), covering general comparison between numerical data, the comparison between the two strings (lexicographically), two Comparison between complex numbers (modulo the size), and through the main function to be invoked and tested.)
    2020-11-28 13:49:29下载
    积分：1
  • BinaryTree
    数据结构二叉树，及其遍历，镜像，输出等相关操作C++源码。(Binary tree data structure and its traversal, mirror, output the operation C++ source.)
    2012-09-01 11:25:15下载
    积分：1
  • migong
    以一个m*n的长方阵表示迷宫，0和1分别表示迷宫中的通路和障碍。设计一个程序，对任意设定的迷宫，求出一条从入口到出口的通路，或得出没有 通路的结论 (To an m* n the long square maze, 0 and 1, respectively maze of paths and obstacles. Design a program, for any set of the maze, find a path from the inlet to the outlet, or the conclusions drawn without passage)
    2013-06-14 10:24:48下载
    积分：1
  • 9
    说明：  任意给定输入的一个小写英文字符串a1a2a3…an-1an (n≥5) 输出：字符串Ana1An-1a2An-2a3…A2an-1A1an,其中Ai为ai的大写形式 例如，输入aybdx，则递归程序输出XaDyBbYdAx (Any given input of a lowercase string a1a2a3 ... an-1an (n ≥ 5) Output: the string Ana1An-1a2An-2a3 A2an-1A1an, which Ai ai uppercase for example, input aybdx recursive program output XaDyBbYdAx)
    2012-05-30 10:59:39下载
    积分：1
  • stack
    数据结构 堆栈 实现了以下功能： cout<<"----------------主菜单---------------"<<endl <<"* 1.建立 *"<<endl <<"* 2.输出 *"<<endl <<"* 3.判断栈是否为空 *"<<endl <<"* 4.栈的长度 *"<<endl <<"* 5.输出栈顶元素 *"<<endl <<"* 6.进栈 *"<<endl <<"* 7.出栈 *"<<endl <<"* 8.遍历 *"<<endl <<"* 9.数制转换 *"<<endl <<"* 10.清空 *"<<endl <<"* 11.销毁 *"<<endl <<"* 12.退出 *"<<endl <<"--------------------------------------"<<endl<<endl (data structure stack)
    2013-11-01 11:05:10下载
    积分：1
  • xiaobaishu
    参加数学建模的同学很可能会遇到这套题。本程序采用链表进行编写，很方便地解决了小白鼠问题。(Mathematical modeling of the students participating are likely to encounter this question, the program uses the list to solve the problem of mice, very convenient.)
    2013-08-29 16:09:43下载
    积分：1
  • Kruskal
    采用Kruskal算法求最小生成树主要数据结构 edgeset GE 存放图中的所有边 int n,int e 存放图中的顶点数与边数 edgeset C 存放生成树中的边 vexlist gv 图中结点的顶点值 adjmatrix s 用来处理图中结点的查找与合并 int m1,m2 一条边上两顶点所属集合的序号 int k 最小生成树中的边数 int d //图中待扫描边元素的下标(For the Minimum Spanning Tree by Kruskal main data structures edgeset GE store all edges in the figure int n, int e store graph vertices and edges edgeset C storage spanning tree edges in the vexlist gv graph node vertex values ​ ​ adjmatrix s used to process graph node to find and merge int m1, m2 an edge belongs to the set number two vertices int k minimum spanning tree edges int d // figure to be Scan edge element subscript)
    2011-05-17 10:22:56下载
    积分：1
  • QUICKSORT
    用C语言实现的普通快速排序，和随机快速排序进行对比(With ordinary C language implementation of quick sort, quick sort and compare the random)
    2015-01-12 15:00:00下载
    积分：1
  • 1_1
    最小生成树算法 克鲁斯法尔算法 球最佳路径(kulru method class maiun void cx )
    2009-09-13 22:45:01下载
    积分：1
  • expression
    利用栈完成算术表达式求值：从键盘或文件中输入算术表达式，计算其结果并显示。要求处理过程为：（1）转换为后缀表达式并输出；（2）对后缀表达式求值并输出。 输入的表达式中可以有整数、实数、括号，运算符包括+、-、*、/、#（代表单目负）。可以多次输入不同的表达式进行计算，直到用户选择“退出”。栈的基本操作可以自己实现，也可以使用系统提供的STL实现。 (Done using an arithmetic expression evaluation stack: file input from the keyboard or an arithmetic expression, calculate and display the results. Requirements process: (1) to postfix expression and output (2) evaluation of the postfix expression and output. Enter the expression can be integers, real numbers, parentheses, operators including+,-,*,/,#( representatives unary minus). You can enter several different expressions are evaluated until the user selects " Exit." Stack can implement the basic operations, you can also use the system implementation of the STL.)
    2011-10-30 14:14:01下载
    积分：1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载

热门标签

Visual C++ matlab C/C++ Java Others Unix_Linux EasyLanguage易语言 Visual Basic C# PDF C++ Delphi VHDL ASP WINDOWS
热门下载

Copyright© 2019-2026 | Powered by Imdn | 浙ICP备16007336号 | IMDN交流 | 联系客服（QQ：3324461878）

本网站资源收集自网络及网站用户上传，若有侵权请邮件至（3324461878@qq.com），核实后我们会在24小时内删除，谢谢！