Searched refs:adjacency_lists (Results 1 – 4 of 4) sorted by relevance
/dports/graphics/py-pygraph/pygraph-0.2.1-4-g037bb2f/pygraph/functions/searching/ |
H A D | depth_first_search.py | 15 def depth_first_search_with_parent_data(graph, root_node = None, adjacency_lists = None): argument 33 if adjacency_lists is None: 36 adj = lambda v: adjacency_lists[v]
|
/dports/graphics/py-pygraph/pygraph-0.2.1-4-g037bb2f/pygraph/functions/planarity/ |
H A D | kocay_algorithm.py | 84 adjacency_lists = dfs_data['adj'] 88 for node_id, adj_list in list(adjacency_lists.items()): 753 …g, parent_lookup, children_lookup = depth_first_search_with_parent_data(graph, adjacency_lists=adj)
|
/dports/math/py-or-tools/or-tools-9.2/ortools/constraint_solver/ |
H A D | routing_search.cc | 2998 std::vector<std::vector<int64_t>>* adjacency_lists) { in AddSymmetricArcsToAdjacencyLists() argument 2999 for (int64_t node = 0; node < adjacency_lists->size(); node++) { in AddSymmetricArcsToAdjacencyLists() 3000 for (int64_t neighbor : (*adjacency_lists)[node]) { in AddSymmetricArcsToAdjacencyLists() 3004 (*adjacency_lists)[neighbor].push_back(node); in AddSymmetricArcsToAdjacencyLists() 3007 std::transform(adjacency_lists->begin(), adjacency_lists->end(), in AddSymmetricArcsToAdjacencyLists() 3008 adjacency_lists->begin(), [](std::vector<int64_t> vec) { in AddSymmetricArcsToAdjacencyLists() 3046 std::vector<std::vector<int64_t>> adjacency_lists(size); in ComputeSavings() local 3081 adjacency_lists[before_node].resize(costed_after_nodes.size()); in ComputeSavings() 3083 adjacency_lists[before_node].begin(), in ComputeSavings() 3089 AddSymmetricArcsToAdjacencyLists(&adjacency_lists); in ComputeSavings() [all …]
|
H A D | routing_search.h | 932 std::vector<std::vector<int64_t> >* adjacency_lists);
|