@@ -94,15 +94,15 @@ void printGraph(std::vector<VertexData> &_vertexData,
9494 _vertexData[i].tileType );
9595 if (ct1It == subt::ConnectionHelper::circuitTypes.end ())
9696 {
97- ignwarn << " No circuit information for: " << _vertexData[i]. tileType
98- << std::endl;
97+ std::cerr << " No circuit information for: "
98+ << _vertexData[i]. tileType << std::endl;
9999 }
100100 auto ct2It = subt::ConnectionHelper::circuitTypes.find (
101101 _vertexData[j].tileType );
102102 if (ct2It == subt::ConnectionHelper::circuitTypes.end ())
103103 {
104- ignwarn << " No circuit information for: " << _vertexData[j]. tileType
105- << std::endl;
104+ std::cerr << " No circuit information for: "
105+ << _vertexData[j]. tileType << std::endl;
106106 }
107107
108108 // Is one of the tile a starting area? If so, the cost should be 1.
@@ -191,7 +191,16 @@ void generateDOT(const std::string &_sdfFile, const std::string &_circuit)
191191 filter = [](const std::string &/* _name*/ ,
192192 const std::string &_type)
193193 {
194- return subt::ConnectionHelper::connectionPoints.count (_type) <= 0 ;
194+ for (const auto &connection : subt::ConnectionHelper::connectionPoints)
195+ {
196+ if (ignition::common::lowercase (connection.first ) ==
197+ ignition::common::lowercase (_type))
198+ {
199+ return false ;
200+ }
201+ }
202+
203+ return true ;
195204 };
196205
197206 std::vector<VertexData> vertexData;
@@ -202,6 +211,7 @@ void generateDOT(const std::string &_sdfFile, const std::string &_circuit)
202211 if (result == std::string::npos || result > str.size ())
203212 break ;
204213
214+
205215 VertexData vd;
206216 bool filled = SdfParser::FillVertexData (includeStr, vd, filter);
207217 if (filled)
0 commit comments