当前位置: 首页>>代码示例>>C++>>正文


C++ TestCase::addEdge方法代码示例

本文整理汇总了C++中TestCase::addEdge方法的典型用法代码示例。如果您正苦于以下问题:C++ TestCase::addEdge方法的具体用法?C++ TestCase::addEdge怎么用?C++ TestCase::addEdge使用的例子?那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在TestCase的用法示例。


在下文中一共展示了TestCase::addEdge方法的1个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的C++代码示例。

示例1: test

void test() {
    TestCase t;
t.addNode(144.000000,511.000000,8.000000,8.000000);
t.addNode(413.000000,155.000000,8.000000,8.000000);
t.addNode(437.000000,169.000000,8.000000,8.000000);
t.addNode(436.000000,122.000000,8.000000,8.000000);
t.addNode(460.000000,150.000000,8.000000,8.000000);
t.addNode(466.000000,178.000000,8.000000,8.000000);
t.addNode(469.000000,198.000000,8.000000,8.000000);
t.addNode(378.000000,332.000000,8.000000,8.000000);
t.addNode(368.000000,315.000000,8.000000,8.000000);
t.addNode(332.000000,341.000000,8.000000,8.000000);
t.addNode(282.000000,374.000000,8.000000,8.000000);
t.addNode(329.000000,364.000000,8.000000,8.000000);
t.addNode(346.000000,390.000000,8.000000,8.000000);
t.addNode(375.000000,402.000000,8.000000,8.000000);
t.addNode(357.000000,438.000000,8.000000,8.000000);
t.addNode(382.000000,422.000000,8.000000,8.000000);
t.addNode(453.000000,280.000000,8.000000,8.000000);
t.addNode(452.000000,258.000000,8.000000,8.000000);
t.addNode(530.000000,449.000000,8.000000,8.000000);
t.addNode(576.000000,431.000000,8.000000,8.000000);
t.addNode(577.000000,408.000000,8.000000,8.000000);
t.addNode(606.000000,438.000000,8.000000,8.000000);
t.addNode(624.000000,467.000000,8.000000,8.000000);
t.addNode(620.000000,492.000000,8.000000,8.000000);
t.addNode(681.000000,492.000000,8.000000,8.000000);
t.addNode(729.000000,528.000000,8.000000,8.000000);
t.addNode(765.000000,515.000000,8.000000,8.000000);
t.addNode(765.000000,492.000000,8.000000,8.000000);
t.addNode(858.000000,538.000000,8.000000,8.000000);
t.addNode(2.000000,544.000000,8.000000,8.000000);
t.addToPath(28,(topology::EdgePoint::RectIntersect)4);
t.addToPath(27,(topology::EdgePoint::RectIntersect)4);
t.addEdge(70.000000);
t.addToPath(28,(topology::EdgePoint::RectIntersect)4);
t.addToPath(26,(topology::EdgePoint::RectIntersect)4);
t.addEdge(70.000000);
t.addToPath(25,(topology::EdgePoint::RectIntersect)4);
t.addToPath(28,(topology::EdgePoint::RectIntersect)4);
t.addEdge(70.000000);
t.addToPath(25,(topology::EdgePoint::RectIntersect)4);
t.addToPath(29,(topology::EdgePoint::RectIntersect)4);
t.addEdge(70.000000);
t.addToPath(17,(topology::EdgePoint::RectIntersect)4);
t.addToPath(24,(topology::EdgePoint::RectIntersect)4);
t.addEdge(70.000000);
t.addToPath(16,(topology::EdgePoint::RectIntersect)4);
//t.addToPath(20,(topology::EdgePoint::RectIntersect)1);
t.addToPath(24,(topology::EdgePoint::RectIntersect)4);
t.addEdge(70.000000);
t.addToPath(16,(topology::EdgePoint::RectIntersect)4);
t.addToPath(7,(topology::EdgePoint::RectIntersect)4);
t.addEdge(70.000000);
t.addToPath(24,(topology::EdgePoint::RectIntersect)4);
t.addToPath(25,(topology::EdgePoint::RectIntersect)4);
t.addEdge(70.000000);
t.addToPath(22,(topology::EdgePoint::RectIntersect)4);
t.addToPath(24,(topology::EdgePoint::RectIntersect)4);
t.addEdge(70.000000);
t.addToPath(22,(topology::EdgePoint::RectIntersect)4);
t.addToPath(0,(topology::EdgePoint::RectIntersect)4);
t.addEdge(70.000000);
t.addToPath(22,(topology::EdgePoint::RectIntersect)4);
t.addToPath(23,(topology::EdgePoint::RectIntersect)4);
t.addEdge(70.000000);
t.addToPath(22,(topology::EdgePoint::RectIntersect)4);
t.addToPath(18,(topology::EdgePoint::RectIntersect)4);
t.addEdge(70.000000);
t.addToPath(21,(topology::EdgePoint::RectIntersect)4);
t.addToPath(20,(topology::EdgePoint::RectIntersect)4);
t.addEdge(70.000000);
t.addToPath(20,(topology::EdgePoint::RectIntersect)4);
t.addToPath(19,(topology::EdgePoint::RectIntersect)4);
t.addEdge(70.000000);
t.addToPath(18,(topology::EdgePoint::RectIntersect)4);
t.addToPath(20,(topology::EdgePoint::RectIntersect)4);
t.addEdge(70.000000);
t.addToPath(18,(topology::EdgePoint::RectIntersect)4);
t.addToPath(16,(topology::EdgePoint::RectIntersect)4);
t.addEdge(70.000000);
t.addToPath(14,(topology::EdgePoint::RectIntersect)4);
t.addToPath(18,(topology::EdgePoint::RectIntersect)4);
t.addEdge(70.000000);
t.addToPath(13,(topology::EdgePoint::RectIntersect)4);
t.addToPath(14,(topology::EdgePoint::RectIntersect)4);
t.addEdge(70.000000);
t.addToPath(15,(topology::EdgePoint::RectIntersect)4);
t.addToPath(14,(topology::EdgePoint::RectIntersect)4);
t.addEdge(70.000000);
t.addToPath(12,(topology::EdgePoint::RectIntersect)4);
t.addToPath(13,(topology::EdgePoint::RectIntersect)4);
t.addEdge(70.000000);
t.addToPath(12,(topology::EdgePoint::RectIntersect)4);
t.addToPath(10,(topology::EdgePoint::RectIntersect)4);
t.addEdge(70.000000);
t.addToPath(11,(topology::EdgePoint::RectIntersect)4);
t.addToPath(12,(topology::EdgePoint::RectIntersect)4);
t.addEdge(70.000000);
t.addToPath(10,(topology::EdgePoint::RectIntersect)4);
//.........这里部分代码省略.........
开发者ID:AidanDelaney,项目名称:adaptagrams,代码行数:101,代码来源:planar.cpp


注:本文中的TestCase::addEdge方法示例由纯净天空整理自Github/MSDocs等开源代码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。