Searched refs:getNeighEdges (Results 1 – 20 of 20) sorted by relevance
213 auto vec_edgs = edCo.getNeighEdges(1);216 vec_edgs = edCo.getNeighEdges(2);235 vec_edgs = edCo.getNeighEdges(1);240 vec_edgs = edCo.getNeighEdges(2);
213 auto vec_edgs = edCo.getNeighEdges(1); in BOOST_AUTO_TEST_CASE()216 vec_edgs = edCo.getNeighEdges(2); in BOOST_AUTO_TEST_CASE()235 vec_edgs = edCo.getNeighEdges(1); in BOOST_AUTO_TEST_CASE()240 vec_edgs = edCo.getNeighEdges(2); in BOOST_AUTO_TEST_CASE()
110 std::vector<Edge> getNeighEdges(Index vertex) const {111 return edge_container_.getNeighEdges(vertex);
76 std::vector<Edge> getNeighEdges(Index vertex) const;
110 std::vector<Edge> getNeighEdges(Index vertex) const { in getNeighEdges() function111 return edge_container_.getNeighEdges(vertex); in getNeighEdges()
44 auto eds = g.getNeighEdges(vertex);
45 vector<Edge> newest_edges = graph.getNeighEdges(vertex); in addEdges_()
87 vector<Edge> neigh_edges = g.getNeighEdges(starting_vertex);279 for (const Edge& sub_graph_edge : graph.getNeighEdges(vertex)) {
60 vector<Edge> neigh_eds = graph.getNeighEdges(startingVertex_); in initialize()
160 vector<Edge> EdgeContainer::getNeighEdges(Index vertex) const { in getNeighEdges() function in votca::tools::EdgeContainer
44 auto eds = g.getNeighEdges(vertex); in addEdges_()
45 vector<Edge> newest_edges = graph.getNeighEdges(vertex);
87 vector<Edge> neigh_edges = g.getNeighEdges(starting_vertex); in exploreBranch()279 for (const Edge& sub_graph_edge : graph.getNeighEdges(vertex)) { in decoupleIsolatedSubGraphs()
67 vector<Edge> neigh_edges = full_graph.getNeighEdges(junction); in removeAllEdgesConnectedToVertex_()130 vector<Edge> neighboring_edges = reduced_graph.getNeighEdges(junction); in calculateEdgesToRemove_()
169 vector<Edge> edges = reduced_graph_.getNeighEdges(junction); in isFusedRing_()