C#校园拼车系统设计+文献综述
有了校园拼车系统：对于学生而言，一则可以以相对较小的成本来打车，不用再挤公交，分流了交通压力；二则可以跨越时间的束缚，在任何时间段以更少的时间到达自己的目的地；三则可以有机会认识不同学校不同班级的同学，增进友谊，交流感情；四则校园拼车安全性更高，有利于学生安全出行和返校。对于社会而言，只要管理好，可谓是百利而无一害。拼车意着在一个校园里，或周围的校区，有着同一个目的地的，或可以顺道路过的， 可以一起搭车出行返程。首先把出发地和目的地连接成一条行车道路，同学之间、校友之间或者外校同学之间结伴一同出行或者返程。也指一起到同一地方旅游的游客为节省燃油费、过路费等费用或车辆磨损而只使用拼车的车辆。
因此，本次的设计，就是通过顾客根据自己的意愿下订单，并且选择拼车与不拼车，同时也可以根据采用迪杰斯特拉算法，寻找出两地点之间的最优路径的选择匹配出的订单，加入拼车行列，以达到拼车的效果。，其中包括添加，修改数据库功能，保存订单记录，并且，司机可以根据查找订单进行选取，如有适合的订单，且订单状态处于未处理状态，司机可以进行选择处理，即订单完成。而本次的设计则是实现了最基本的路径距离最短的选择。过程中，主要解决了路径的分析，以及算法的使用的大难题。
毕业论文关键词：拼车；
Campus Carpool system
Abstract:
With the improvement of the level of social development and people's lives, people's scope of activities greatly increased the demand for transportation gradually expanded, and secondly, also to aspects of time, space and other new demands, the campus appeared carpool will increasingly teachers and students attention, will be a new bridge between you and me.
With campus Carpool system: For the students, it may be a relatively small cost to take a taxi, no longer crowded bus, the persion of traffic pressure; two across the shackles of time, at any period of time less time reach their destination; three can have the opportunity to meet students from different schools in different classes, enhance friendship, exchange of feelings; four campus ride more secure, and help students to travel safely to school. For society, as long as management is good, it can be described as any harm. Carpool means a campus or around the campus, with the same destination, or you can take the opportunity to pass, you can ride along with return travel. First purposefully designed as a route, a few students or this did not know the students outside the school, strangers couples return. Also refers to the same place together tourists to save fuel costs, toll fees or vehicle wear and use only the carpool vehicles.
Therefore, this design is by the customer according to their own wishes under the order and select carpooling and not carpool, but also according to the use of Dijkstra algorithm to find out the location to select the optimal path between two matches out Orders, joined the ranks of carpooling to achieve carpool effect. Including add, modify database functions, save the order record, and the driver can be selected according to the order to find and, if appropriate orders, and order status in the untreated state, the driver can choose treatment, that the order is completed. This time, the design is to achieve the most basic way to select the shortest distance. Process, mainly to solve the analytical approach, and the big problem the algorithm in use.