Searched refs:sorted_graph (Results 1 – 2 of 2) sorted by relevance
242 hb_vector_t<vertex_t> sorted_graph; in sort_kahn() local243 if (unlikely (!check_success (sorted_graph.resize (vertices_.length)))) return; in sort_kahn()260 sorted_graph[new_id] = next; in sort_kahn()271 check_success (!sorted_graph.in_error ()); in sort_kahn()275 remap_all_obj_indices (id_map, &sorted_graph); in sort_kahn()277 hb_swap (vertices_, sorted_graph); in sort_kahn()278 sorted_graph.fini_deep (); in sort_kahn()297 hb_vector_t<vertex_t> sorted_graph; in sort_shortest_distance() local298 if (unlikely (!check_success (sorted_graph.resize (vertices_.length)))) return; in sort_shortest_distance()314 sorted_graph[new_id] = next; in sort_shortest_distance()[all …]
125 GraphDef sorted_graph; in PrintStructure() local126 TF_RETURN_IF_ERROR(SortByExecutionOrder(graph, &sorted_graph)); in PrintStructure()127 for (const NodeDef& node : sorted_graph.node()) { in PrintStructure()