C++ (Cpp) invoke_visitors Examples

Example #1

File: breadth_first_search.hpp Project: ricortiz/SOFAFramework

 graph::bfs_visitor_event_not_overridden
 finish_vertex(Vertex u, Graph& g)
 {
   invoke_visitors(m_vis, u, g, ::boost::on_finish_vertex());
   return graph::bfs_visitor_event_not_overridden();
 }

Example #2

File: bellman_ford_shortest_paths.hpp Project: AlexisMaizel/Virtual_Lateral_Roots

 void examine_edge(Edge u, Graph& g) {
   invoke_visitors(m_vis, u, g, on_examine_edge());
 }

Example #3

File: breadth_first_search.hpp Project: ricortiz/SOFAFramework

 graph::bfs_visitor_event_not_overridden
 non_tree_edge(Edge e, Graph& g)
 {
   invoke_visitors(m_vis, e, g, ::boost::on_non_tree_edge());
   return graph::bfs_visitor_event_not_overridden();
 }

Example #4

File: breadth_first_search.hpp Project: ricortiz/SOFAFramework

 graph::bfs_visitor_event_not_overridden
 black_target(Edge e, Graph& g)
 {
   invoke_visitors(m_vis, e, g, ::boost::on_black_target());
   return graph::bfs_visitor_event_not_overridden();
 }

Example #5

File: breadth_first_search.hpp Project: AsherBond/PDAL

 graph::bfs_visitor_event_not_overridden
 examine_edge(Edge e, Graph& g)
 {
   invoke_visitors(m_vis, e, g, ::pdalboost::on_examine_edge());
   return graph::bfs_visitor_event_not_overridden();
 }

Example #6

File: dijkstra_shortest_paths.hpp Project: evemu/boost

 void edge_not_relaxed(Edge e, Graph& g) {
   invoke_visitors(this->m_vis, e, g, on_edge_not_relaxed());
 }

Example #7

File: breadth_first_search.hpp Project: AlexS2172/IVRM

 void finish_vertex(Vertex u, Graph& g) {
   invoke_visitors(m_vis, u, g, ::boost::on_finish_vertex());
 }

Example #8

File: breadth_first_search.hpp Project: AlexS2172/IVRM

 void discover_vertex(Vertex u, Graph& g) {
   invoke_visitors(m_vis, u, g, ::boost::on_discover_vertex());
 }

Example #9

File: breadth_first_search.hpp Project: AlexS2172/IVRM

 void gray_target(Edge e, Graph& g) {
   invoke_visitors(m_vis, e, g, ::boost::on_gray_target());
 }

Example #10

File: breadth_first_search.hpp Project: AlexS2172/IVRM

 void black_target(Edge e, Graph& g) {
   invoke_visitors(m_vis, e, g, ::boost::on_black_target());
 }

Example #11

File: breadth_first_search.hpp Project: AlexS2172/IVRM

 void non_tree_edge(Edge e, Graph& g) {
   invoke_visitors(m_vis, e, g, ::boost::on_non_tree_edge());
 }

Example #12

File: breadth_first_search.hpp Project: AlexS2172/IVRM

 void examine_edge(Edge e, Graph& g) {
   invoke_visitors(m_vis, e, g, ::boost::on_examine_edge());
 }

Example #13

File: breadth_first_search.hpp Project: AlexS2172/IVRM

 void examine_vertex(Vertex u, Graph& g) {
   invoke_visitors(m_vis, u, g, ::boost::on_examine_vertex());
 }

Example #14

File: bellman_ford_shortest_paths.hpp Project: AlexisMaizel/Virtual_Lateral_Roots

 void edge_not_relaxed(Edge u, Graph& g) {
   invoke_visitors(m_vis, u, g, on_edge_not_relaxed());
 }

Example #15

File: breadth_first_search.hpp Project: AsherBond/PDAL

 graph::bfs_visitor_event_not_overridden
 examine_vertex(Vertex u, Graph& g)
 {
   invoke_visitors(m_vis, u, g, ::pdalboost::on_examine_vertex());
   return graph::bfs_visitor_event_not_overridden();
 }

Example #16

File: bellman_ford_shortest_paths.hpp Project: AlexisMaizel/Virtual_Lateral_Roots

 void edge_not_minimized(Edge u, Graph& g) {
   invoke_visitors(m_vis, u, g, on_edge_not_minimized());
 }

Example #17

File: breadth_first_search.hpp Project: AlexS2172/IVRM

 void initialize_vertex(Vertex u, Graph& g) {
   invoke_visitors(m_vis, u, g, ::boost::on_initialize_vertex());
 }