文件名称:netlayer
介绍说明--下载内容均来自于网络,请自行研究使用
VC+MO最短路径算法 // 计算线的几何长度
double CalcLength()
// 通过线的id得到线数据
BOOL GetLineData(int id)
// 得到距离某点最近的线段,返回该线段的id
int GetNearestLineData( double x, double y)
// 判断两点是否重合
BOOL IsPtCoincide( NetPoint ptFirst, NetPoint ptSecond )
// 得到最邻近的点-VC MO shortest path algorithm// calculate the geometric line length double CalcLength ()// line through the data line id be BOOL GetLineData (int id)// a distance to the nearest point of a segment, return to the line of id int GetNearestLineData (double x, double y)// 2:00 judgment whether coincidence BOOL IsPtCoincide (NetPo int ptFirst, NetPoint ptSecond)// most neighboring points
double CalcLength()
// 通过线的id得到线数据
BOOL GetLineData(int id)
// 得到距离某点最近的线段,返回该线段的id
int GetNearestLineData( double x, double y)
// 判断两点是否重合
BOOL IsPtCoincide( NetPoint ptFirst, NetPoint ptSecond )
// 得到最邻近的点-VC MO shortest path algorithm// calculate the geometric line length double CalcLength ()// line through the data line id be BOOL GetLineData (int id)// a distance to the nearest point of a segment, return to the line of id int GetNearestLineData (double x, double y)// 2:00 judgment whether coincidence BOOL IsPtCoincide (NetPo int ptFirst, NetPoint ptSecond)// most neighboring points
(系统自动生成,下载前可以参看下载内容)
下载文件列表
netlayer.doc