IT2FLS (1)

说明：  基于gulp的打包流程，简单实用，条例清楚(Packaging process based on gulp)

交通预测和分配程序,由VB开发,用与交通规划与经济评价系统.-Traffic forecasting and allocation process, by the VB development, use and transport planning and economic evaluation system.

说明：  利用Python面向对象知识实现飞机大战游戏(Application of Aircraft Battle Game with Python)

图论的软件.. 只需输入点和权值就可计算最短路-Graph theory software .. just enter the right point and the calculated values can be the most short-circuit

帮助umat学习者快速入门，并且详细理解umat的内在运行机制(Umat help learners QuickStart, and a detailed understanding of the inner workings of the mechanism umat)

说明：  Teacher team management: manage the information of training teachers, add pictures, modify, classify and manage Potential development management: potential development information management, which can be added, modified and other related operations Enrollment management: release employment enrollment information, which can be managed, such as modification and deletion

说明：  计算6个数字的AC值，您通过键盘输入6个整数，程序将会帮你计算出AC值(Calculate the acvalue of 6 numbers)

说明：  围绕Simulink软件的仿真和代码生成技术，从原理上展开阐述，把握整体，注重细节，让读者深刻认识Simulink的运行原理。结构化的章节安排和丰富多彩的案例展示了Simulink在模型建立、工业流程仿真及嵌入式控制等方面的应用技巧和方法。(Around the simulation and code generation technology of Simulink software, we elaborate on the principle, grasp the whole and pay attention to details, so that readers can have a deep understanding of the operation principle of Simulink. Structured chapters and colorful cases show Simulink's application skills and methods in modeling, industrial process simulation and embedded control.)

字符串读写函数fgets和fputs ，读字符串函数fgets函数的功能1-string literacy fgets and fputs function, reading the string functions fgets of functionality 1

本书示例丰富,图文并茂,以简明易懂的方式阐释了算法,旨在帮助程序员在日常项目中更好地利用 算法为软件开发助力。前三章介绍算法基础,包括二分查找、大 O 表示法、两种基本的数据结构以及递归 等。余下的篇幅将主要介绍应用广泛的算法,具体内容包括 :面对具体问题时的解决技巧,比如何时采用 贪婪算法或动态规划 ;散列表的应用 ;图算法 ;K 最近邻算法。 本书适合所有程序员、计算机专业相关师生以及对算法感兴趣的读者(This book is rich in examples and illustrates algorithms in a concise and easy-to-understand way. It aims to help programmers make better use of algorithms in daily projects to help software development. The first three chapters introduce the basic algorithms, including binary search, large O representation, two basic data structures and recursion. The rest of the paper will focus on the widely used algorithms, including: when to use greedy algorithm or dynamic programming, hash table application, graph algorithm, K nearest neighbor algorithm when facing specific problems. This book is suitable for all programmers, computer-related teachers and students, and readers interested in algorithms.)