| /dports/databases/percona57-client/boost_1_59_0/boost/graph/ |
| H A D | max_cardinality_matching.hpp | 35 matching_size(const Graph& g, MateMap mate, VertexIndexMap vm) in matching_size()
60 matching_size(const Graph& g, MateMap mate) in matching_size()
69 bool is_a_matching(const Graph& g, MateMap mate, VertexIndexMap) in is_a_matching()
90 inline bool is_a_matching(const Graph& g, MateMap mate) in is_a_matching()
502 vertex_to_vertex_map_t mate; member in boost::edmonds_augmenting_path_finder
839 bool matching(const Graph& g, MateMap mate, VertexIndexMap vm) in matching()
860 …inline bool checked_edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate, VertexIndex… in checked_edmonds_maximum_cardinality_matching()
872 inline bool checked_edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate) in checked_edmonds_maximum_cardinality_matching()
881 inline void edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate, VertexIndexMap vm) in edmonds_maximum_cardinality_matching()
892 inline void edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate) in edmonds_maximum_cardinality_matching()
|
| /dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/graph/ |
| H A D | max_cardinality_matching.hpp | 35 matching_size(const Graph& g, MateMap mate, VertexIndexMap vm) in matching_size()
60 matching_size(const Graph& g, MateMap mate) in matching_size()
69 bool is_a_matching(const Graph& g, MateMap mate, VertexIndexMap) in is_a_matching()
90 inline bool is_a_matching(const Graph& g, MateMap mate) in is_a_matching()
502 vertex_to_vertex_map_t mate; member in boost::edmonds_augmenting_path_finder
839 bool matching(const Graph& g, MateMap mate, VertexIndexMap vm) in matching()
860 …inline bool checked_edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate, VertexIndex… in checked_edmonds_maximum_cardinality_matching()
872 inline bool checked_edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate) in checked_edmonds_maximum_cardinality_matching()
881 inline void edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate, VertexIndexMap vm) in edmonds_maximum_cardinality_matching()
892 inline void edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate) in edmonds_maximum_cardinality_matching()
|
| /dports/devel/boost-libs/boost_1_72_0/boost/graph/ |
| H A D | max_cardinality_matching.hpp | 35 matching_size(const Graph& g, MateMap mate, VertexIndexMap vm) in matching_size()
60 matching_size(const Graph& g, MateMap mate) in matching_size()
69 bool is_a_matching(const Graph& g, MateMap mate, VertexIndexMap) in is_a_matching()
90 inline bool is_a_matching(const Graph& g, MateMap mate) in is_a_matching()
502 vertex_to_vertex_map_t mate; member in boost::edmonds_augmenting_path_finder
839 bool matching(const Graph& g, MateMap mate, VertexIndexMap vm) in matching()
860 …inline bool checked_edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate, VertexIndex… in checked_edmonds_maximum_cardinality_matching()
872 inline bool checked_edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate) in checked_edmonds_maximum_cardinality_matching()
881 inline void edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate, VertexIndexMap vm) in edmonds_maximum_cardinality_matching()
892 inline void edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate) in edmonds_maximum_cardinality_matching()
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/graph/ |
| H A D | max_cardinality_matching.hpp | 35 matching_size(const Graph& g, MateMap mate, VertexIndexMap vm) in matching_size()
60 matching_size(const Graph& g, MateMap mate) in matching_size()
69 bool is_a_matching(const Graph& g, MateMap mate, VertexIndexMap) in is_a_matching()
90 inline bool is_a_matching(const Graph& g, MateMap mate) in is_a_matching()
502 vertex_to_vertex_map_t mate; member in boost::edmonds_augmenting_path_finder
839 bool matching(const Graph& g, MateMap mate, VertexIndexMap vm) in matching()
860 …inline bool checked_edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate, VertexIndex… in checked_edmonds_maximum_cardinality_matching()
872 inline bool checked_edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate) in checked_edmonds_maximum_cardinality_matching()
881 inline void edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate, VertexIndexMap vm) in edmonds_maximum_cardinality_matching()
892 inline void edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate) in edmonds_maximum_cardinality_matching()
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/boost/graph/ |
| H A D | max_cardinality_matching.hpp | 35 matching_size(const Graph& g, MateMap mate, VertexIndexMap vm) in matching_size()
60 matching_size(const Graph& g, MateMap mate) in matching_size()
69 bool is_a_matching(const Graph& g, MateMap mate, VertexIndexMap) in is_a_matching()
90 inline bool is_a_matching(const Graph& g, MateMap mate) in is_a_matching()
502 vertex_to_vertex_map_t mate; member in boost::edmonds_augmenting_path_finder
839 bool matching(const Graph& g, MateMap mate, VertexIndexMap vm) in matching()
860 …inline bool checked_edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate, VertexIndex… in checked_edmonds_maximum_cardinality_matching()
872 inline bool checked_edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate) in checked_edmonds_maximum_cardinality_matching()
881 inline void edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate, VertexIndexMap vm) in edmonds_maximum_cardinality_matching()
892 inline void edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate) in edmonds_maximum_cardinality_matching()
|
| /dports/databases/mysql57-client/mysql-5.7.36/boost/boost_1_59_0/boost/graph/ |
| H A D | max_cardinality_matching.hpp | 35 matching_size(const Graph& g, MateMap mate, VertexIndexMap vm) in matching_size()
60 matching_size(const Graph& g, MateMap mate) in matching_size()
69 bool is_a_matching(const Graph& g, MateMap mate, VertexIndexMap) in is_a_matching()
90 inline bool is_a_matching(const Graph& g, MateMap mate) in is_a_matching()
502 vertex_to_vertex_map_t mate; member in boost::edmonds_augmenting_path_finder
839 bool matching(const Graph& g, MateMap mate, VertexIndexMap vm) in matching()
860 …inline bool checked_edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate, VertexIndex… in checked_edmonds_maximum_cardinality_matching()
872 inline bool checked_edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate) in checked_edmonds_maximum_cardinality_matching()
881 inline void edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate, VertexIndexMap vm) in edmonds_maximum_cardinality_matching()
892 inline void edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate) in edmonds_maximum_cardinality_matching()
|
| /dports/devel/hyperscan/boost_1_75_0/boost/graph/ |
| H A D | max_cardinality_matching.hpp | 43 const Graph& g, MateMap mate, VertexIndexMap vm) in matching_size()
65 const Graph& g, MateMap mate) in matching_size()
71 bool is_a_matching(const Graph& g, MateMap mate, VertexIndexMap) in is_a_matching()
89 inline bool is_a_matching(const Graph& g, MateMap mate) in is_a_matching()
476 vertex_to_vertex_map_t mate; member in boost::edmonds_augmenting_path_finder
793 bool matching(const Graph& g, MateMap mate, VertexIndexMap vm) in matching()
813 const Graph& g, MateMap mate, VertexIndexMap vm) in checked_edmonds_maximum_cardinality_matching()
822 const Graph& g, MateMap mate) in checked_edmonds_maximum_cardinality_matching()
830 const Graph& g, MateMap mate, VertexIndexMap vm) in edmonds_maximum_cardinality_matching()
837 inline void edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate) in edmonds_maximum_cardinality_matching()
|
| /dports/math/combblas/CombBLAS_beta_16_2/BipartiteMatchings/ |
| H A D | auction.cpp | 382 [](VertexType vtx, int64_t mate){return vtx;}, in auction()
383 [](VertexType vtx, int64_t mate){return mate==-1;}, in auction()
405 [](VertexType vtx, int64_t mate){return vtx.objID;}, in auction()
406 [](VertexType vtx, int64_t mate){return true;}, in auction()
413 … [](int64_t newbidder, int64_t mate){return mate;}, in auction()
414 … [](int64_t newbidder, int64_t mate){return mate!=-1;}, in auction()
|
| /dports/math/py-graphillion/Graphillion-1.3/src/subsetting/spec/ |
| H A D | FrontierBasedSearch.hpp | 280 int takable(Count& c, Mate const* mate, Graph::EdgeInfo const& e) const { in takable()
326 bool doTake(Count& count, Mate* mate, Graph::EdgeInfo const& e) const { in doTake()
336 bool doNotTake(Count& count, Mate* mate, Graph::EdgeInfo const& e) const { in doNotTake()
383 void update(Mate* mate, Graph::EdgeInfo const& e, in update()
447 int getChild(Count& count, Mate* mate, int level, int take) const { in getChild()
|
| H A D | DegreeConstraint.hpp | 48 void shiftMate(Mate* mate, int d) const { in shiftMate()
99 int getChild(Mate* mate, int level, int take) const { in getChild()
|
| /dports/french/verbiste/verbiste-0.1.47/src/ |
| H A D | Makefile.am | 14 SUBDIRS += mate subdir
|
| /dports/x11/workrave/workrave-1.10.44/frontend/applets/ |
| H A D | Makefile.am | 8 SUBDIRS = win32 common gnome3 indicator gnome-shell cinnamon xfce mate subdir
|
| /dports/devel/boost-docs/boost_1_72_0/libs/graph/example/ |
| H A D | matching_example.cpp | 66 std::vector<graph_traits<my_graph>::vertex_descriptor> mate(n_vertices); in main() local
|
| /dports/devel/swig/swig-4.0.2/Examples/test-suite/ |
| H A D | lextype.i | 52 Giraffe mate(Giraffe g[2]) { return g[0]; } in mate() function
|
| /dports/devel/boost-python-libs/boost_1_72_0/libs/graph/example/ |
| H A D | matching_example.cpp | 66 std::vector<graph_traits<my_graph>::vertex_descriptor> mate(n_vertices); in main() local
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/graph/example/ |
| H A D | matching_example.cpp | 66 std::vector<graph_traits<my_graph>::vertex_descriptor> mate(n_vertices); in main() local
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/graph/example/ |
| H A D | matching_example.cpp | 66 std::vector<graph_traits<my_graph>::vertex_descriptor> mate(n_vertices); in main() local
|
| /dports/databases/percona57-server/boost_1_59_0/libs/graph/example/ |
| H A D | matching_example.cpp | 66 std::vector<graph_traits<my_graph>::vertex_descriptor> mate(n_vertices); in main() local
|
| /dports/databases/xtrabackup/boost_1_59_0/libs/graph/example/ |
| H A D | matching_example.cpp | 66 std::vector<graph_traits<my_graph>::vertex_descriptor> mate(n_vertices); in main() local
|
| /dports/databases/percona57-client/boost_1_59_0/libs/graph/example/ |
| H A D | matching_example.cpp | 66 std::vector<graph_traits<my_graph>::vertex_descriptor> mate(n_vertices); in main() local
|
| /dports/devel/boost-libs/boost_1_72_0/libs/graph/example/ |
| H A D | matching_example.cpp | 66 std::vector<graph_traits<my_graph>::vertex_descriptor> mate(n_vertices); in main() local
|
| /dports/devel/hyperscan/boost_1_75_0/libs/graph/example/ |
| H A D | matching_example.cpp | 65 std::vector< graph_traits< my_graph >::vertex_descriptor > mate(n_vertices); in main() local
|
| /dports/lang/gleam/gleam-0.18.2/cargo-crates/petgraph-0.6.0/src/algo/ |
| H A D | matching.rs | 14 mate: Vec<Option<G::NodeId>>, field
38 pub fn mate(&self, node: G::NodeId) -> Option<G::NodeId> { in mate() function
136 mate: &'a [Option<G::NodeId>], field
162 mate: &'a [Option<G::NodeId>], field
220 let mut mate = vec![None; graph.node_bound()]; in greedy_matching_inner() localVariable
|
| /dports/devel/grex/grex-1.3.0/cargo-crates/petgraph-0.6.0/src/algo/ |
| H A D | matching.rs | 14 mate: Vec<Option<G::NodeId>>, field
38 pub fn mate(&self, node: G::NodeId) -> Option<G::NodeId> { in mate() function
136 mate: &'a [Option<G::NodeId>], field
162 mate: &'a [Option<G::NodeId>], field
220 let mut mate = vec![None; graph.node_bound()]; in greedy_matching_inner() localVariable
|
| /dports/devel/texlab/texlab-3.3.0/cargo-crates/petgraph-0.6.0/src/algo/ |
| H A D | matching.rs | 14 mate: Vec<Option<G::NodeId>>, field
38 pub fn mate(&self, node: G::NodeId) -> Option<G::NodeId> { in mate() function
136 mate: &'a [Option<G::NodeId>], field
162 mate: &'a [Option<G::NodeId>], field
220 let mut mate = vec![None; graph.node_bound()]; in greedy_matching_inner() localVariable
|