GPS 接收程序 DEMO。
HsGpsDll Library 1.1
A GPS Control/Component for C/C++
HsGpsDll is a Windows Dynamic Link Library which provides access to any NMEA-183 compliant GPS receiver via a serial communications port. HsGpsDll is designed for use from Visual C, Visual Basic or other languages, capable of calling DLL functions. HsGpsDll allows a user application to read from a GPS device the current GPS position fix, velocity over ground (speed in kilometers per hour), plus number of of sattelites in view, current altitude (against mean sea level) and UTC date and time
CAN1.c and CAN2.c are a simple example of configuring a CAN network to
transmit and receive data on a CAN network, and how to move information to
and from CAN RAM message objects. Each C8051F040-TB CAN node is configured
to send a message when it s P3.7 button is depressed/released, with a 0x11
to indicate the button is pushed, and 0x00 when released. Each node also has
a message object configured to receive messages. The C8051 tests the
received data and will turn on/off the target board s LED. When one target
is loaded with CAN2.c and the other is loaded with CAN1.c, one target
board s push-button will control the other target board s LED, establishing
a simple control link via the CAN bus and can be observed directly on the
target boards.
Windows applications using C++ and the Microsoft Foundation Class (MFC) library. The text builds from the ground up, first describing the Windows architecture and showing how MFC works with that architecture next covering the document/view framework that simplifies the creation of industrial-strength programs and finally illustrating advanced concepts like the usage of dynamic link libraries (DLL), creating Internet clients, and building form-based applications.
In some graphs, the shortest path is given by optimizing two different metrics: the sum of weights of the edges and the number of edges. For example: if two paths with equal cost exist then, the path with the least number of edges is chosen as the shortest path. Given this metric, you have find out the shortest path between a given pair of vertices in the input graph. The output should be the number of edges on the path, the cost of the shortest path, and the path itself. Input is the adjacency matrix and the two vertices.
