- s -

• safe_get_edge() : ged::GEDGraph
• safe_is_edge() : ged::GEDGraph
• save_node_map() : ged::GEDData< UserNodeLabel, UserEdgeLabel >
• set_edit_costs() : ged::GEDEnv< UserNodeID, UserNodeLabel, UserEdgeLabel >
• set_greedy_method() : ged::LSAPESolver , ged::LSAPSolver
• set_hungarian_algorithm() : ged::LSAPSolver
• set_induced_cost() : ged::NodeMap
• set_label() : ged::GEDGraph
• set_lower_bound() : ged::Result
• set_method() : ged::GEDEnv< UserNodeID, UserNodeLabel, UserEdgeLabel >
• set_model() : ged::LSAPESolver
• set_options() : ged::GEDMethod< UserNodeLabel, UserEdgeLabel >
• set_problem() : ged::LSAPESolver , ged::LSAPSolver
• set_to_val() : ged::Matrix< ScalarT >
• setup_adjacency_matrix() : ged::GEDGraph
• shuffled_graph_copies_available() : ged::GEDData< UserNodeLabel, UserEdgeLabel >
• solve() : ged::LSAPESolver , ged::LSAPSolver
• sort_node_maps_and_set_upper_bound() : ged::Result
• swap() : ged::Matrix< ScalarT >
• swap_assignments() : ged::GEDData< UserNodeLabel, UserEdgeLabel >
• swap_cost() : ged::GEDData< UserNodeLabel, UserEdgeLabel >