判断两条直线是否平行，也可以判断是否相交，并可以求出交点。-To determine whether the two parallel straight lines, you can also determine whether the intersection, and can find the intersection.

java实现，空间任意直线交点数量，用Eclipse可以直接打开工程-java implementation, space intersection of any number of lines, can open the project with Eclipse

找到水平线和竖直线的交点个数，文件输入水平线和竖直线的坐标-Find the intersection of horizontal and vertical lines the number of horizontal and vertical line file input coordinates

用java语言编写的求水平和垂直线断交点数目的算法，这个程序的算法是《算法引论—一种创造性方法》中的算法-Written request with the java horizontal and vertical lines the purpose of diplomatic relations point algorithm, the algorithm of this program is the " Introduction to Algorithms- A creative ap

给定两直线，判断直线的状态，是否有交点，无需调试，简单易懂。(Given two straight lines to determine the state of the line, whether there is intersection, without debugging, easy to understand.The stable marriage problem based on matching algorithm, without debugging.)