| begin() const | ged::GEDData< UserNodeLabel, UserEdgeLabel > | |
| compute_induced_cost(const GEDGraph &g, const GEDGraph &h, NodeMap &node_map) const | ged::GEDData< UserNodeLabel, UserEdgeLabel > | |
| edge_cost(LabelID label1, LabelID label2) const | ged::GEDData< UserNodeLabel, UserEdgeLabel > | |
| end() const | ged::GEDData< UserNodeLabel, UserEdgeLabel > | |
| graph(GEDGraph::GraphID graph_id) const | ged::GEDData< UserNodeLabel, UserEdgeLabel > | |
| id_shuffled_graph_copy(GEDGraph::GraphID graph_id) const | ged::GEDData< UserNodeLabel, UserEdgeLabel > | |
| is_shuffled_graph_copy(GEDGraph::GraphID graph_id) const | ged::GEDData< UserNodeLabel, UserEdgeLabel > | |
| load_node_map(const std::string &filename, GEDGraph::NodeID g_id, GEDGraph::NodeID h_id, NodeMap &node_map) const | ged::GEDData< UserNodeLabel, UserEdgeLabel > | |
| max_edge_del_cost(const GEDGraph &graph) const | ged::GEDData< UserNodeLabel, UserEdgeLabel > | |
| max_edge_edit_cost() const | ged::GEDData< UserNodeLabel, UserEdgeLabel > | |
| max_edge_edit_cost(const GEDGraph &g, const GEDGraph &h) const | ged::GEDData< UserNodeLabel, UserEdgeLabel > | |
| max_edge_ins_cost(const GEDGraph &graph) const | ged::GEDData< UserNodeLabel, UserEdgeLabel > | |
| max_edge_subs_cost(const GEDGraph &g, const GEDGraph &h) const | ged::GEDData< UserNodeLabel, UserEdgeLabel > | |
| max_edit_cost(const GEDGraph &g, const GEDGraph &h) const | ged::GEDData< UserNodeLabel, UserEdgeLabel > | |
| max_node_del_cost(const GEDGraph &graph) const | ged::GEDData< UserNodeLabel, UserEdgeLabel > | |
| max_node_edit_cost() const | ged::GEDData< UserNodeLabel, UserEdgeLabel > | |
| max_node_edit_cost(const GEDGraph &g, const GEDGraph &h) const | ged::GEDData< UserNodeLabel, UserEdgeLabel > | |
| max_node_ins_cost(const GEDGraph &graph) const | ged::GEDData< UserNodeLabel, UserEdgeLabel > | |
| max_node_subs_cost(const GEDGraph &g, const GEDGraph &h) const | ged::GEDData< UserNodeLabel, UserEdgeLabel > | |
| max_num_edges() const | ged::GEDData< UserNodeLabel, UserEdgeLabel > | |
| max_num_nodes() const | ged::GEDData< UserNodeLabel, UserEdgeLabel > | |
| mean_edge_del_cost(const GEDGraph &graph) const | ged::GEDData< UserNodeLabel, UserEdgeLabel > | |
| mean_edge_ins_cost(const GEDGraph &graph) const | ged::GEDData< UserNodeLabel, UserEdgeLabel > | |
| mean_edge_subs_cost(const GEDGraph &g, const GEDGraph &h) const | ged::GEDData< UserNodeLabel, UserEdgeLabel > | |
| mean_node_del_cost(const GEDGraph &graph) const | ged::GEDData< UserNodeLabel, UserEdgeLabel > | |
| mean_node_ins_cost(const GEDGraph &graph) const | ged::GEDData< UserNodeLabel, UserEdgeLabel > | |
| mean_node_subs_cost(const GEDGraph &g, const GEDGraph &h) const | ged::GEDData< UserNodeLabel, UserEdgeLabel > | |
| min_edge_del_cost(const GEDGraph &graph) const | ged::GEDData< UserNodeLabel, UserEdgeLabel > | |
| min_edge_edit_cost(const GEDGraph &g, const GEDGraph &h) const | ged::GEDData< UserNodeLabel, UserEdgeLabel > | |
| min_edge_ins_cost(const GEDGraph &graph) const | ged::GEDData< UserNodeLabel, UserEdgeLabel > | |
| min_edge_subs_cost(const GEDGraph &g, const GEDGraph &h) const | ged::GEDData< UserNodeLabel, UserEdgeLabel > | |
| min_edit_cost(const GEDGraph &g, const GEDGraph &h) const | ged::GEDData< UserNodeLabel, UserEdgeLabel > | |
| min_node_del_cost(const GEDGraph &graph) const | ged::GEDData< UserNodeLabel, UserEdgeLabel > | |
| min_node_edit_cost(const GEDGraph &g, const GEDGraph &h) const | ged::GEDData< UserNodeLabel, UserEdgeLabel > | |
| min_node_ins_cost(const GEDGraph &graph) const | ged::GEDData< UserNodeLabel, UserEdgeLabel > | |
| min_node_subs_cost(const GEDGraph &g, const GEDGraph &h) const | ged::GEDData< UserNodeLabel, UserEdgeLabel > | |
| node_cost(LabelID label1, LabelID label2) const | ged::GEDData< UserNodeLabel, UserEdgeLabel > | |
| num_edge_labels() const | ged::GEDData< UserNodeLabel, UserEdgeLabel > | |
| num_graphs() const | ged::GEDData< UserNodeLabel, UserEdgeLabel > | |
| num_graphs_without_shuffled_copies() const | ged::GEDData< UserNodeLabel, UserEdgeLabel > | |
| num_node_labels() const | ged::GEDData< UserNodeLabel, UserEdgeLabel > | |
| quasimetric_costs() const | ged::GEDData< UserNodeLabel, UserEdgeLabel > | |
| quasimetric_costs(const GEDGraph &g, const GEDGraph &h) const | ged::GEDData< UserNodeLabel, UserEdgeLabel > | |
| save_node_map(const std::string &filename, GEDGraph::NodeID g_id, GEDGraph::NodeID h_id, const NodeMap &node_map, bool append=true) const | ged::GEDData< UserNodeLabel, UserEdgeLabel > | |
| shuffled_graph_copies_available() const | ged::GEDData< UserNodeLabel, UserEdgeLabel > | |
| swap_assignments(const NodeMap::Assignment &assignment_1, const NodeMap::Assignment &assignment_2, double swap_cost, NodeMap &node_map) const | ged::GEDData< UserNodeLabel, UserEdgeLabel > | |
| swap_cost(const GEDGraph &g, const GEDGraph &h, const NodeMap::Assignment &assignment_1, const NodeMap::Assignment &assignment_2, NodeMap &node_map) const | ged::GEDData< UserNodeLabel, UserEdgeLabel > | |
| vectorize_edge_label(LabelID edge_label, std::vector< double > &vector_representation) const | ged::GEDData< UserNodeLabel, UserEdgeLabel > | |
| vectorize_node_label(LabelID node_label, std::vector< double > &vector_representation) const | ged::GEDData< UserNodeLabel, UserEdgeLabel > | |
| ~GEDData() | ged::GEDData< UserNodeLabel, UserEdgeLabel > | |
