Home
last modified time | relevance | path

Searched refs:EdgeList (Results 1 – 25 of 448) sorted by relevance

12345678910>>...18

/dports/devel/boost-docs/boost_1_72_0/boost/graph/
H A Dvector_as_graph.hpp60 template <class EdgeList>
80 template <class EdgeList>
85 template <class EdgeList>
90 template <class EdgeList>
103 template <class EdgeList>
134 template <class EdgeList>
142 template <class EdgeList>
162 typename EdgeList::size_type
198 add_edge(typename EdgeList::value_type u, typename EdgeList::value_type v, in add_edge()
208 edge(typename EdgeList::value_type u, typename EdgeList::value_type v, in edge()
[all …]
/dports/devel/R-cran-BH/BH/inst/include/boost/graph/
H A Dvector_as_graph.hpp62 template < class EdgeList > struct graph_traits< std::vector< EdgeList > >
81 template < class EdgeList > struct edge_property_type< std::vector< EdgeList > >
162 typename EdgeList::value_type v, const std::vector< EdgeList, Alloc >& g) in out_edges()
171 typename EdgeList::value_type v, const std::vector< EdgeList, Alloc >& g) in out_degree()
180 typename EdgeList::value_type v, const std::vector< EdgeList, Alloc >& g) in adjacent_vertices()
205 add_edge(typename EdgeList::value_type u, typename EdgeList::value_type v, in add_edge() argument
215 typename EdgeList::value_type u, typename EdgeList::value_type v, in edge()
228 typename EdgeList::value_type v, std::vector< EdgeList, Allocator >& g) in remove_edge()
284 typename EdgeList::value_type add_vertex(std::vector< EdgeList, Allocator >& g) in add_vertex() argument
292 typename EdgeList::value_type u, std::vector< EdgeList, Allocator >& g) in clear_vertex()
[all …]
/dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/graph/
H A Dvector_as_graph.hpp63 template <class EdgeList>
82 template <class EdgeList>
87 template <class EdgeList>
92 template <class EdgeList>
106 template <class EdgeList>
134 template <class EdgeList>
142 template <class EdgeList>
162 typename EdgeList::size_type
201 add_edge(typename EdgeList::value_type u, typename EdgeList::value_type v, in add_edge()
211 edge(typename EdgeList::value_type u, typename EdgeList::value_type v, in edge()
[all …]
/dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/graph/
H A Dvector_as_graph.hpp60 template <class EdgeList>
80 template <class EdgeList>
85 template <class EdgeList>
90 template <class EdgeList>
103 template <class EdgeList>
131 template <class EdgeList>
139 template <class EdgeList>
159 typename EdgeList::size_type
195 add_edge(typename EdgeList::value_type u, typename EdgeList::value_type v, in add_edge()
205 edge(typename EdgeList::value_type u, typename EdgeList::value_type v, in edge()
[all …]
/dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/graph/
H A Dvector_as_graph.hpp62 template < class EdgeList > struct graph_traits< std::vector< EdgeList > >
81 template < class EdgeList > struct edge_property_type< std::vector< EdgeList > >
162 typename EdgeList::value_type v, const std::vector< EdgeList, Alloc >& g) in out_edges()
171 typename EdgeList::value_type v, const std::vector< EdgeList, Alloc >& g) in out_degree()
180 typename EdgeList::value_type v, const std::vector< EdgeList, Alloc >& g) in adjacent_vertices()
205 add_edge(typename EdgeList::value_type u, typename EdgeList::value_type v, in add_edge() argument
215 typename EdgeList::value_type u, typename EdgeList::value_type v, in edge()
228 typename EdgeList::value_type v, std::vector< EdgeList, Allocator >& g) in remove_edge()
284 typename EdgeList::value_type add_vertex(std::vector< EdgeList, Allocator >& g) in add_vertex() argument
292 typename EdgeList::value_type u, std::vector< EdgeList, Allocator >& g) in clear_vertex()
[all …]
/dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/graph/
H A Dvector_as_graph.hpp62 template < class EdgeList > struct graph_traits< std::vector< EdgeList > >
81 template < class EdgeList > struct edge_property_type< std::vector< EdgeList > >
162 typename EdgeList::value_type v, const std::vector< EdgeList, Alloc >& g) in out_edges()
171 typename EdgeList::value_type v, const std::vector< EdgeList, Alloc >& g) in out_degree()
180 typename EdgeList::value_type v, const std::vector< EdgeList, Alloc >& g) in adjacent_vertices()
205 add_edge(typename EdgeList::value_type u, typename EdgeList::value_type v, in add_edge() argument
215 typename EdgeList::value_type u, typename EdgeList::value_type v, in edge()
228 typename EdgeList::value_type v, std::vector< EdgeList, Allocator >& g) in remove_edge()
284 typename EdgeList::value_type add_vertex(std::vector< EdgeList, Allocator >& g) in add_vertex() argument
292 typename EdgeList::value_type u, std::vector< EdgeList, Allocator >& g) in clear_vertex()
[all …]
/dports/databases/percona57-server/boost_1_59_0/boost/graph/
H A Dvector_as_graph.hpp60 template <class EdgeList>
80 template <class EdgeList>
85 template <class EdgeList>
90 template <class EdgeList>
103 template <class EdgeList>
131 template <class EdgeList>
139 template <class EdgeList>
159 typename EdgeList::size_type
195 add_edge(typename EdgeList::value_type u, typename EdgeList::value_type v, in add_edge()
205 edge(typename EdgeList::value_type u, typename EdgeList::value_type v, in edge()
[all …]
/dports/databases/xtrabackup/boost_1_59_0/boost/graph/
H A Dvector_as_graph.hpp60 template <class EdgeList>
80 template <class EdgeList>
85 template <class EdgeList>
90 template <class EdgeList>
103 template <class EdgeList>
131 template <class EdgeList>
139 template <class EdgeList>
159 typename EdgeList::size_type
195 add_edge(typename EdgeList::value_type u, typename EdgeList::value_type v, in add_edge()
205 edge(typename EdgeList::value_type u, typename EdgeList::value_type v, in edge()
[all …]
/dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/graph/
H A Dvector_as_graph.hpp60 template <class EdgeList>
80 template <class EdgeList>
85 template <class EdgeList>
90 template <class EdgeList>
103 template <class EdgeList>
131 template <class EdgeList>
139 template <class EdgeList>
159 typename EdgeList::size_type
195 add_edge(typename EdgeList::value_type u, typename EdgeList::value_type v, in add_edge()
205 edge(typename EdgeList::value_type u, typename EdgeList::value_type v, in edge()
[all …]
/dports/databases/percona57-client/boost_1_59_0/boost/graph/
H A Dvector_as_graph.hpp60 template <class EdgeList>
80 template <class EdgeList>
85 template <class EdgeList>
90 template <class EdgeList>
103 template <class EdgeList>
131 template <class EdgeList>
139 template <class EdgeList>
159 typename EdgeList::size_type
195 add_edge(typename EdgeList::value_type u, typename EdgeList::value_type v, in add_edge()
205 edge(typename EdgeList::value_type u, typename EdgeList::value_type v, in edge()
[all …]
/dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/graph/
H A Dvector_as_graph.hpp60 template <class EdgeList>
80 template <class EdgeList>
85 template <class EdgeList>
90 template <class EdgeList>
103 template <class EdgeList>
131 template <class EdgeList>
139 template <class EdgeList>
159 typename EdgeList::size_type
195 add_edge(typename EdgeList::value_type u, typename EdgeList::value_type v, in add_edge()
205 edge(typename EdgeList::value_type u, typename EdgeList::value_type v, in edge()
[all …]
/dports/devel/boost-libs/boost_1_72_0/boost/graph/
H A Dvector_as_graph.hpp60 template <class EdgeList>
80 template <class EdgeList>
85 template <class EdgeList>
90 template <class EdgeList>
103 template <class EdgeList>
134 template <class EdgeList>
142 template <class EdgeList>
162 typename EdgeList::size_type
198 add_edge(typename EdgeList::value_type u, typename EdgeList::value_type v, in add_edge()
208 edge(typename EdgeList::value_type u, typename EdgeList::value_type v, in edge()
[all …]
/dports/devel/boost-python-libs/boost_1_72_0/boost/graph/
H A Dvector_as_graph.hpp60 template <class EdgeList>
80 template <class EdgeList>
85 template <class EdgeList>
90 template <class EdgeList>
103 template <class EdgeList>
134 template <class EdgeList>
142 template <class EdgeList>
162 typename EdgeList::size_type
198 add_edge(typename EdgeList::value_type u, typename EdgeList::value_type v, in add_edge()
208 edge(typename EdgeList::value_type u, typename EdgeList::value_type v, in edge()
[all …]
/dports/databases/mysqlwsrep57-server/boost_1_59_0/boost/graph/
H A Dvector_as_graph.hpp60 template <class EdgeList>
80 template <class EdgeList>
85 template <class EdgeList>
90 template <class EdgeList>
103 template <class EdgeList>
131 template <class EdgeList>
139 template <class EdgeList>
159 typename EdgeList::size_type
195 add_edge(typename EdgeList::value_type u, typename EdgeList::value_type v, in add_edge()
205 edge(typename EdgeList::value_type u, typename EdgeList::value_type v, in edge()
[all …]
/dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/graph/
H A Dvector_as_graph.hpp60 template <class EdgeList>
80 template <class EdgeList>
85 template <class EdgeList>
90 template <class EdgeList>
103 template <class EdgeList>
131 template <class EdgeList>
139 template <class EdgeList>
159 typename EdgeList::size_type
195 add_edge(typename EdgeList::value_type u, typename EdgeList::value_type v, in add_edge()
205 edge(typename EdgeList::value_type u, typename EdgeList::value_type v, in edge()
[all …]
/dports/databases/mysql57-client/mysql-5.7.36/boost/boost_1_59_0/boost/graph/
H A Dvector_as_graph.hpp60 template <class EdgeList>
80 template <class EdgeList>
85 template <class EdgeList>
90 template <class EdgeList>
103 template <class EdgeList>
131 template <class EdgeList>
139 template <class EdgeList>
159 typename EdgeList::size_type
195 add_edge(typename EdgeList::value_type u, typename EdgeList::value_type v, in add_edge()
205 edge(typename EdgeList::value_type u, typename EdgeList::value_type v, in edge()
[all …]
/dports/devel/hyperscan/boost_1_75_0/boost/graph/
H A Dvector_as_graph.hpp62 template < class EdgeList > struct graph_traits< std::vector< EdgeList > >
81 template < class EdgeList > struct edge_property_type< std::vector< EdgeList > >
162 typename EdgeList::value_type v, const std::vector< EdgeList, Alloc >& g) in out_edges()
171 typename EdgeList::value_type v, const std::vector< EdgeList, Alloc >& g) in out_degree()
180 typename EdgeList::value_type v, const std::vector< EdgeList, Alloc >& g) in adjacent_vertices()
205 add_edge(typename EdgeList::value_type u, typename EdgeList::value_type v, in add_edge() argument
215 typename EdgeList::value_type u, typename EdgeList::value_type v, in edge()
228 typename EdgeList::value_type v, std::vector< EdgeList, Allocator >& g) in remove_edge()
284 typename EdgeList::value_type add_vertex(std::vector< EdgeList, Allocator >& g) in add_vertex() argument
292 typename EdgeList::value_type u, std::vector< EdgeList, Allocator >& g) in clear_vertex()
[all …]
/dports/biology/lamarc/lamarc-2.1.8/boost/graph/
H A Dvector_as_graph.hpp60 template <class EdgeList>
79 template <class EdgeList>
84 template <class EdgeList>
89 template <class EdgeList>
103 template <class EdgeList>
131 template <class EdgeList>
139 template <class EdgeList>
159 typename EdgeList::size_type
198 add_edge(typename EdgeList::value_type u, typename EdgeList::value_type v, in add_edge()
208 edge(typename EdgeList::value_type u, typename EdgeList::value_type v, in edge()
[all …]
/dports/biology/ugene/ugene-40.1/src/plugins_3rdparty/umuscle/src/muscle/
H A Dedgelist.cpp4 EdgeList::EdgeList() in EdgeList() function in EdgeList
12 EdgeList::~EdgeList() in ~EdgeList()
17 void EdgeList::Clear() in Clear()
27 void EdgeList::Add(unsigned uNode1, unsigned uNode2) in Add()
36 unsigned EdgeList::GetCount() const in GetCount()
41 void EdgeList::GetEdge(unsigned uIndex, unsigned *ptruNode1, unsigned *ptruNode2) const in GetEdge()
49 void EdgeList::Copy(const EdgeList &rhs) in Copy()
62 void EdgeList::Expand() in Expand()
79 void EdgeList::LogMe() const in LogMe()
/dports/biology/muscle/muscle-3.8.1551/
H A Dedgelist.cpp4 EdgeList::EdgeList() in EdgeList() function in EdgeList
12 EdgeList::~EdgeList() in ~EdgeList()
17 void EdgeList::Clear() in Clear()
27 void EdgeList::Add(unsigned uNode1, unsigned uNode2) in Add()
36 unsigned EdgeList::GetCount() const in GetCount()
41 void EdgeList::GetEdge(unsigned uIndex, unsigned *ptruNode1, unsigned *ptruNode2) const in GetEdge()
49 void EdgeList::Copy(const EdgeList &rhs) in Copy()
62 void EdgeList::Expand() in Expand()
79 void EdgeList::LogMe() const in LogMe()
/dports/cad/repsnapper/repsnapper-2.5a4/libraries/amf/amftools-code/src/
H A DnVertices.cpp30 EdgeList = In.EdgeList; in operator =()
39 EdgeList.clear(); in Clear()
56 for(std::vector<nEdge>::iterator it = EdgeList.begin(); it != EdgeList.end(); it++){ in WriteXML()
82 EdgeList.push_back(tmpEdge); in ReadXML()
101 for (std::vector<nEdge>::iterator it = EdgeList.begin(); it!=EdgeList.end(); it++){ in CheckValid()
124 EdgeList.erase(EdgeList.begin()+EdgeToDelete[i]); in CheckValid()
151 for (std::vector<nEdge>::iterator it = EdgeList.begin(); it!=EdgeList.end(); it++){ in Rotate()
/dports/math/coxeter3/coxeter-7b5a1f0/
H A Dwgraph.h29 typedef List<Edge> EdgeList; typedef
43 List<EdgeList> d_edge;
53 const EdgeList& edge(const Vertex& x) const; /* inlined */
59 EdgeList& edge(const Vertex& x); /* inlined */
80 const EdgeList& edge(const Vertex& x) const; /* inlined */
86 EdgeList& edge(const Vertex& x); /* inlined */
98 inline const EdgeList& WGraph::edge(const Vertex& x) const in edge()
102 inline EdgeList& WGraph::edge(const Vertex& x) {return d_graph->edge(x);} in edge()
107 inline const EdgeList& OrientedGraph::edge(const Vertex& x) const in edge()
110 inline EdgeList& OrientedGraph::edge(const Vertex& x) {return d_edge[x];} in edge()
/dports/graphics/geos/geos-3.9.1/src/geomgraph/
H A DEdgeList.cpp43 EdgeList::add(Edge* e) in add()
51 EdgeList::addAll(const std::vector<Edge*>& edgeColl) in addAll()
65 EdgeList::findEqualEdge(const Edge* e) const in findEqualEdge()
87 EdgeList::get(int i) in get()
98 EdgeList::findEdgeIndex(const Edge* e) const in findEdgeIndex()
109 EdgeList::print() in print()
129 EdgeList::clearList() in clearList()
139 operator<< (std::ostream& os, const EdgeList& el) in operator <<()
/dports/math/vtk8/VTK-8.2.0/Filters/Hybrid/
H A DvtkProjectedTerrainPath.cxx196 this->EdgeList = new EdgeListType; in RequestData()
222 for (EdgeListIterator iter=this->EdgeList->begin(); in RequestData()
223 iter != this->EdgeList->end(); in RequestData()
236 delete this->EdgeList; in RequestData()
254 this->SplitEdge(eId,(*this->EdgeList)[eId].tNeg); in RemoveOcclusions()
262 this->SplitEdge(eId,(*this->EdgeList)[eId].tPos); in RemoveOcclusions()
289 this->SplitEdge(eId,(*this->EdgeList)[eId].tPos); in HugTerrain()
305 this->SplitEdge(eId,(*this->EdgeList)[eId].tNeg); in HugTerrain()
325 vtkEdge &e =(*this->EdgeList)[eId]; in SplitEdge()
342 this->EdgeList->push_back(vtkEdge(pId,v2)); in SplitEdge()
[all …]
/dports/math/vtk9/VTK-9.1.0/Filters/Hybrid/
H A DvtkProjectedTerrainPath.cxx199 this->EdgeList = new EdgeListType; in RequestData()
207 this->EdgeList->push_back(vtkEdge(pts[j], pts[j + 1])); in RequestData()
226 for (EdgeListIterator iter = this->EdgeList->begin(); iter != this->EdgeList->end(); ++iter) in RequestData()
238 delete this->EdgeList; in RequestData()
256 this->SplitEdge(eId, (*this->EdgeList)[eId].tNeg); in RemoveOcclusions()
264 this->SplitEdge(eId, (*this->EdgeList)[eId].tPos); in RemoveOcclusions()
291 this->SplitEdge(eId, (*this->EdgeList)[eId].tPos); in HugTerrain()
307 this->SplitEdge(eId, (*this->EdgeList)[eId].tNeg); in HugTerrain()
326 vtkEdge& e = (*this->EdgeList)[eId]; in SplitEdge()
343 this->EdgeList->push_back(vtkEdge(pId, v2)); in SplitEdge()
[all …]

12345678910>>...18