登录
首页 » Visual C++ » Di_Tu_Pi_Pei

Di_Tu_Pi_Pei

于 2015-12-09 发布 文件大小:3079KB
0 272
下载积分: 1 下载次数: 19

代码说明:

  将出租车采集到的GPS数据匹配到电子地图上,并将车辆定位在道路上。(The taxi collected GPS data matching to the electronic map, and the position of the vehicle on the road.)

文件列表:

main.cpp,497,2014-03-28
map_layer.cpp,25577,2014-04-03
map_layer.h,3253,2014-04-02
R.MID,21822166,2013-12-25
R.MIF,7010631,2014-03-28

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • 2
    说明:  VC++串口通信20个经典源码合集,经典全集,串口开发必看(VC++ Serial communication source collection of 20 classic, classic Collection, Must See Serial Development)
    2011-04-21 09:51:05下载
    积分:1
  • TreeCtrl
    树形控件,可以插入头像,利用该控件可以实现类似QQ好友列表的功能(Tree class, it can show img at every item,you can use it to make friends list box like QQ)
    2013-12-09 11:26:32下载
    积分:1
  • sprc090
    download the file to be able to program for c6713
    2017-09-22 19:28:53下载
    积分:1
  • DiskKey
    得到文件系统的相关注册表键值,并且显示出来(get the register key value of file system and show it. )
    2005-07-11 16:24:46下载
    积分:1
  • SCTP_Client_Server-master
    SCTP实验,实现客户端和服务器端传输数据(SCTP experiment, to achieve the client and server side data transfer)
    2013-12-24 16:44:40下载
    积分:1
  • asd
    WO YIJING CHUAN GUO LE A S
    2011-02-12 14:13:09下载
    积分:1
  • be-happy-to-learn-VC
    说明:  [趣味程序导学Visual.Cpp].董未名.文字版([Fun Program Guidance Visual.Cpp]. Weiming Dong. Text Version)
    2011-04-04 17:59:37下载
    积分:1
  • delaunaydemo
    生成delaunay三角网的源代码,以及演示demo(Delaunay triangulation generation of source code, and the demonstration of demo)
    2021-04-08 12:39:01下载
    积分:1
  • 7.GDIhuitu
    本实验要求利用GDI绘图相关知识,绘制广州地铁线路图。该实验我建立的是MFC工程的基本对话框程序。当点击对话框上的按钮时,便会出现地铁线路图。因此,显示地铁图的相关代码添加在该按钮通过消息映射对应的函数内。 (The dialog box procedure. When you click the button on the dialog box will appear when the MRT. Therefore, the metro map display-related code to add the button to pass the message map in the corresponding function. )
    2010-07-14 15:57:48下载
    积分:1
  • knapsackproblem
    有不同重量的物品n件,求从这n件物品中任取一部分物品放入背包,使选中的物品的总重量不超过指定的限制重量,但选中物品的价值之合为最大。即任意给定物品个数及它们的重量和价值,在最大的限制重量一定的情况下,为了使价值最大,选出最优解。(There are different weights of items n pieces from n items in order to obtain any portion of the goods into the backpack, so that the total weight of the selected items does not exceed the specified weight limit, but the combined value of selected items as the greatest. That any given number of items and their weight and value limits the maximum weight of certain circumstances, in order to value the most, select the optimal solution.)
    2010-03-09 08:21:56下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载