这是我的作业，是当时全班最好的，最短路径演示系统，能自定义节点和路径，显示出最短路径，节点用了组件，整个程序用了皮肤组件。-This is my work, then the whole class is the best, shortest path demonstration system can be defined nodes and trails. show that the shortest path, using a node components, with the whole

城市公交路线查询， 采用狄克斯特拉算法；可以实现查询非直达线路，专车等。里面自带3个经典皮肤-Urban public transport routes inquiries, using狄克斯特拉algorithm can query the non-direct routes, car and so on. Inside its own 3 classic skin

基于聚类算法的皮肤病实例，利用k均值算法对皮肤病进行聚类-Based clustering algorithm skin instance using the k-means algorithm clustering of skin diseases