25 namespace perception {
30 MatchCost(
size_t ridx,
size_t cidx,
double cost);
60 std::vector<NodeNodePair>* assignments,
61 std::vector<size_t>* unassigned_rows,
62 std::vector<size_t>* unassigned_cols);
64 std::string
Name()
const {
return "GnnBipartiteGraphMatcher"; }
Definition: gnn_bipartite_graph_matcher.h:49
std::string Name() const
Definition: gnn_bipartite_graph_matcher.h:64
MatchCost(size_t ridx, size_t cidx, double cost)
Definition: gnn_bipartite_graph_matcher.h:28
PlanningContext is the runtime context in planning. It is persistent across multiple frames...
Definition: atomic_hash_map.h:25
Definition: base_bipartite_graph_matcher.h:34
std::vector< int > row_tag_
Definition: gnn_bipartite_graph_matcher.h:67
std::vector< int > col_tag_
Definition: gnn_bipartite_graph_matcher.h:68
friend bool operator<(const MatchCost &m1, const MatchCost &m2)
Definition: base_bipartite_graph_matcher.h:39
friend std::ostream & operator<<(std::ostream &os, const MatchCost &m)