23 #include <navgraph/constraints/static_list_edge_constraint.h>
39 : NavGraphEdgeConstraint(name)
50 std::vector<fawkes::NavGraphEdge> &edge_list)
81 edge_list_.push_back(edge);
91 for (
const NavGraphEdge &n : edges) {
102 std::vector<NavGraphEdge>::iterator e = std::find(edge_list_.begin(), edge_list_.end(), edge);
103 if (e != edge_list_.end()) {
116 return (std::find(edge_list_.begin(), edge_list_.end(), edge) != edge_list_.end());
122 const std::vector<fawkes::NavGraphEdge> &
132 if (!edge_list_.empty()) {
142 for (NavGraphEdge &e : edge_list_) {
143 if ((e.from() == from.name() && e.to() == to.name())
144 || (e.from() == to.name() && e.to() == from.name())) {