编译原理C-编译器源代码,川大，绝对原创！

HTML中往往会需要绘图，D3.js是相对来说较好的选择，当所制作项目需要在无互联网环境下运行时，需要该js。d3.v4.min.js为最新的js

每次都是去两个网站上下载，常用的就这三个，直接放一起下载就好了

jquery包

jquery的resize()事件，直接调用没有起作用引入该文件来实现resize()方法。

http://blog.csdn.net/a2241076850/article/details/54629392 这是我的Bolog使用看内部，

echarts.min.js echarts引入文件

MUI的时间控件，方便很多的小伙伴们一起使用，帮助跟多有需求的同学，mui.picker.min.js

jquery.min.js插件，实际运用项目中还是很好用。分享出来大家一起共享，如果大家觉得不错，希望能给个好评。

最大流/最小割算法的简介，理解常用最大流最小割概念的文献，值得学习。 minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision. The combinatorial optimization literature provides many min-cut/max-flow algorithms with different polynomial time complexity. Their practical efficiency, however, has to date been studied mainly outside the scope of computer vision. The goal of this paper is to provide an experimental comparison of the efficiency of min-cut/max flow algorithms for applications in vision. We compare the running times of several standard algorithms, as well as a new algorithm that we have recently developed. The algorithms we study include both Goldberg-Tarjan style “push-relabel” methods and algorithms based on Ford- Fulkerson style “augmenting paths.” We benchmark these algorithms on a number of typical graphs in the contexts of image restoration, stereo, and segmentation. In many cases, our new algorithm works several times faster than any of the other methods, making near real-time performance possible. An implementation of our max-flow/min-cut algorithm is available upon request for research purposes.