Search - map file

Search - map file - List

[VC/MFC] dijkstra DL : 1: dijkstra算法问题描述目前网络上电子地图的使用很普遍。利用电子地图可以很方便地确定从一个地点到另一个地点的路径。特别地，可确定在城市中的公交换乘路线。电子地图可以看成是一个图，而公交线路图可看成是带权有向图G =(V,E)，其中每条边的权是非负实数。你的任务：对给定的一个（无向）图G，及G中的两点s、t，计算从顶点s到顶点t的最短距离和最少路段数。输入输入文件中有若干组测试数据（组数不超过20）。每组测试数据的第1行是一个正整数n，表示地图G的顶点数，n<50。接下来的n行采用邻接矩阵方式描述这一个地图，第i行有n个数，依次表示第i个顶点与第1、2、3、…、n个顶点的路径长。假如两个顶点间无边相连，用一个-1表示。相邻的两个整数之间用空格隔开。注意，图中每个顶点 i处都没有自己到自己的边。再在下面的一行上给出两个整数s、t，表示上述地图上的两个顶点。每组测试数据输入结束后空一行。输入直到文件结束。-Description of the problem At present the use of electronic maps on the network are common. The use of electronic maps can be easily identified from one location to another location path. In particular, can be determined in the cities bus transfer routes. E-map can be seen as a map, while the bus route map can be seen as a weighted directed graph G = (V, E), in which each edge of the right of a non-negative real number. Your task: given a (undirected) Figure G, and G, two points s, t, calculated from the vertex s to vertex t, the shortest distance and the minimum number of sections. Input Input file there are several groups of test data (group of not more than 20). Each test data row 1 is a positive integer n, said the map of G, vertices, n <50. The next n lines describe the use of adjacency matrix, a map, the first i have n number of rows in turn said that the first i vertices with the first 1,2,3, ..., n vertices of the path length. If the two ver
Date : 2026-01-07 Size : 862kb User : 谷
[VC/MFC] mfc DL : 0: 该MFC参考含盖了Microsoft基本类库中的类、全局函数、全局变量和宏的内容。参考中“类层次结构图”是为了方便查找某个类的基类。该MFC参考通常不描述通过继承的函数或操作符。若要寻求这些函数的信息，请参阅类层次结构图中该类的基类信息。每个类的说明文档包括：该类的概括、类成员的种类、以及该成员函数、重载操作符或数据成员的基本用途。仅撰写应用程序或派生类在一般情况下对于公共和保护类成员的使用说明。寻求完整的类成员的列表，请参阅该类的头文件。-The MFC class library reference covers the basic classes in Microsoft, global functions, global variables and macro elements. Reference to the " class hierarchy map" to facilitate the search for a class of base class. The MFC is usually not described by reference to the inherited function or operator. To seek these functions, please refer to the class hierarchy diagram of such a base class information. Documentation for each category include: the broad class, class member types, and the member functions, overloaded operators or data member of the basic purposes. Only written applications or derived class in the general public and the protection of class members for the use of instructions. For a complete list of class members, see the class header file.
Date : 2026-01-07 Size : 1.38mb User : 一条
[VC/MFC] code DL : 0: 实现对地图信息文件的读取根据道路信息的不同属性对文件中的道路信息利用不同的算法进行排序排序后的道路信息可以写到新的文件中，并可替换原来的地图文件 -Map information to achieve file read road information according to different attributes of road information in the document using different sorting algorithms to sort the way information can be written after the new file, and can replace the original map files
Date : 2026-01-07 Size : 3.9mb User : wangle
[VC/MFC] words DL : 0: 一个基于STL的小程序。由stl中的map来实现。功能是统计一个文本文件中的所有单词个数。以及列出所有重复单词。学习stl的好例子哦！-A small program based on STL. The map from the stl to achieve. Function is a text file statistics all the words in number. And a list of all the repeated words. Good example of learning stl Oh!
Date : 2026-01-07 Size : 10kb User : liuli
[VC/MFC] stack-and-heap DL : 0: exe file memory description document, it is goog for you, to understand the memory map. Chinease version.
Date : 2026-01-07 Size : 193kb User : 大个
[VC/MFC] MapX-and-MapInfo-electronic-map DL : 0: MapInfo 以及 MapX 控件，可以实现复杂的 GIS 系统设计。首先利用 MapInfo 9.5 构建地图数据，然后通过 Geoset Manager 生成 Geoset 格式文件，最后在 Visual Studio 2008 编程环境下、利用 C#编程语言对 MapX 控件进行二次开发-MapInfo and MapX control, can achieve sophisticated GIS system design. Firstly, MapInfo 9.5 build map data, and then through Geoset Manager generates Geoset format file, and finally in Visual Studio 2008 programming environment using C# programming language MapX secondary development controls
Date : 2026-01-07 Size : 722kb User : 吴少凯