Home
last modified time | relevance | path

Searched refs:B_G (Results 1 – 25 of 116) sorted by relevance

12345

/dports/databases/pgrouting/pgrouting-3.2.0/include/visitors/
H A Ddfs_visitor.hpp60 template <typename B_G>
61 void start_vertex(V v, const B_G&) { in start_vertex() argument
66 template <typename B_G>
67 void examine_edge(E e, const B_G&) { in examine_edge() argument
79 template <typename B_G>
80 void tree_edge(E e, const B_G&) { in tree_edge() argument
H A Ddfs_visitor_with_root.hpp49 template <typename B_G>
50 void tree_edge(E e, const B_G&) { in tree_edge() argument
53 template <typename B_G>
54 void start_vertex(V v, const B_G&) { in start_vertex() argument
H A Ddijkstra_one_goal_visitor.hpp42 template <class B_G>
43 void examine_vertex(V &u, B_G &) { in examine_vertex() argument
H A Dedges_order_dfs_visitor.hpp47 template <typename B_G>
48 void tree_edge(E e, const B_G&) { in tree_edge() argument
H A Dedges_order_bfs_visitor.hpp46 template <class B_G>
47 void tree_edge(E e, const B_G&) { in tree_edge() argument
H A Dprim_dijkstra_visitor.hpp47 template <class B_G>
48 void finish_vertex(V v, B_G&) { in finish_vertex() argument
/dports/databases/pgrouting/pgrouting-3.2.0/include/astar/
H A Dpgr_astar.hpp57 typedef typename G::B_G B_G; typedef in pgrouting::algorithms::Pgr_astar
216 class distance_heuristic : public boost::astar_heuristic< B_G, double > {
218 distance_heuristic(B_G &g, V goal, int heuristic, double factor) in distance_heuristic()
225 B_G &g, in distance_heuristic()
279 B_G &m_g;
290 template <class B_G>
291 void examine_vertex(V u, B_G &g) { in examine_vertex()
306 template <class B_G>
307 void examine_vertex(V u, B_G &g) { in examine_vertex()
/dports/databases/pgrouting/pgrouting-3.2.0/include/dijkstra/
H A Dpgr_dijkstra.hpp760 template <class B_G>
799 template <class B_G>
835 template <class B_G>
846 template <class B_G>
847 void examine_edge(E e, B_G &g) { in examine_edge()
855 template <class B_G>
856 void edge_relaxed(E, B_G &) { in edge_relaxed() argument
861 template <class B_G>
870 template <class B_G>
871 void finish_vertex(V, B_G &) { in finish_vertex() argument
[all …]
/dports/databases/pgrouting/pgrouting-3.2.0/include/spanningTree/
H A Dpgr_mst.hpp50 typedef typename G::B_G B_G; typedef in pgrouting::functions::Pgr_mst
256 boost::filtered_graph<B_G, InSpanning, boost::keep_all> in dfs_forest()
281 boost::filtered_graph<B_G, InSpanning, boost::keep_all> in dfs_ordering()
327 boost::filtered_graph<B_G, InSpanning, boost::keep_all> in bfs_ordering()
H A Dpgr_kruskal.hpp61 typedef typename G::B_G B_G; typedef in pgrouting::functions::Pgr_kruskal
H A Dpgr_prim.hpp50 typedef typename G::B_G B_G; typedef in pgrouting::functions::Pgr_prim
/dports/databases/pgrouting/pgrouting-3.2.0/include/contraction/
H A Dpgr_linearContraction.hpp53 typedef typename G::B_G B_G; typedef in pgrouting::contraction::Pgr_linear
82 BGL_FORALL_VERTICES_T(v, graph.graph, B_G) { in calculateVertices()
/dports/databases/pgrouting/pgrouting-3.2.0/include/breadthFirstSearch/
H A Dpgr_breadthFirstSearch.hpp46 typedef typename G::B_G B_G; typedef in pgrouting::functions::Pgr_breadthFirstSearch
H A Dpgr_binaryBreadthFirstSearch.hpp48 typedef typename G::B_G B_G; typedef in pgrouting::functions::Pgr_binaryBreadthFirstSearch
/dports/databases/pgrouting/pgrouting-3.2.0/include/dagShortestPath/
H A Dpgr_dagShortestPath.hpp322 template <class B_G>
323 void examine_vertex(V &u, B_G &) { in examine_vertex() argument
338 template <class B_G>
339 void examine_vertex(V u, B_G &) { in examine_vertex() argument
/dports/databases/pgrouting/pgrouting-3.2.0/src/alpha_shape/
H A Dpgr_alphaShape.cpp93 template <typename B_G, typename V>
95 get_predecessors(V source, V target, const B_G &subg) { in get_predecessors()
125 template <typename B_G, typename V>
127 get_polygon(V source, V target, const std::vector<V> & predecessors, const B_G &graph, std::set<E> … in get_polygon()
/dports/science/hypre/hypre-2.23.0/src/parcsr_ls/
H A Dams.h27 HYPRE_Solver B_G; member
122 #define hypre_AMSDataPoissonBetaAMG(ams_data) ((ams_data)->B_G)
H A Dams.c835 ams_data -> B_G = 0; in hypre_AMSCreate()
902 if (ams_data -> B_G) in hypre_AMSDestroy()
903 HYPRE_BoomerAMGDestroy(ams_data -> B_G); in hypre_AMSDestroy()
2977 HYPRE_BoomerAMGCreate(&ams_data -> B_G); in hypre_AMSSetup()
2981 HYPRE_BoomerAMGSetNumSweeps(ams_data -> B_G, 1); in hypre_AMSSetup()
2982 HYPRE_BoomerAMGSetMaxLevels(ams_data -> B_G, 25); in hypre_AMSSetup()
2983 HYPRE_BoomerAMGSetTol(ams_data -> B_G, 0.0); in hypre_AMSSetup()
2984 HYPRE_BoomerAMGSetMaxIter(ams_data -> B_G, 1); in hypre_AMSSetup()
2987 HYPRE_BoomerAMGSetPMaxElmts(ams_data -> B_G, ams_data -> B_G_Pmax); in hypre_AMSSetup()
2994 HYPRE_BoomerAMGSetMaxLevels(ams_data -> B_G, 2); in hypre_AMSSetup()
[all …]
/dports/databases/pgrouting/pgrouting-3.2.0/include/bellman_ford/
H A Dpgr_edwardMoore.hpp45 typedef typename G::B_G B_G; typedef in pgrouting::functions::Pgr_edwardMoore
/dports/graphics/pfstools/pfstools-2.1.0/src/pfsglview/
H A Dm_histogram.cpp65 #define B_G 0.25 macro
207 case 3: glColor4f(B_R, B_G, B_B, B_A); break ; in drawHistogram()
306 case 3: glColor4f(B_R, B_G, B_B, hue); break ; in drawHistogram()
/dports/science/hypre/hypre-2.23.0/src/docs/usr-manual/
H A Dsolvers-ams.rst87 * :math:`B_G` and :math:`{\mathbf B}_{{\mathbf \Pi}}` -- efficient (AMG) solvers
91 original edge space and subspace corrections based on :math:`B_G` and
180 :math:`B_G`, and :math:`2` refers to a call to BoomerAMG for :math:`{\mathbf
/dports/science/tfel/tfel-3.4.0/docs/web/
H A DMohrCoulomb.md133 where \(\psi\) is the dilatancy angle. \(K_G\), \(A_G\) and \(B_G\) follow
141 A_G - B_G \sin 3\theta & |\theta| \geq \theta_\mathrm{T}
149 …B_G &= \frac{1}{3} \frac{1}{\cos 3\theta_\mathrm{T}} \left[ \mathrm{sign \theta} \sin \theta_\math…
/dports/databases/pgrouting/pgrouting-3.2.0/include/cpp_common/
H A Dpgr_base_graph.hpp226 typedef G B_G; typedef in pgrouting::graph::Pgr_base_graph
/dports/math/gap/gap-4.11.0/lib/
H A Dautsr.gi1330 # B_G must be swappes with a generator of B_H.
/dports/japanese/font-kanji18/ja-font-kanji18-1.0_3/
H A Dkanji18.ah332 M."+*+FMFZYJ>UJ[`?>0=#:[:R[R%'J3*]:98/K'A[\.B_G/N.MS;G;KN)W'(

12345