[pgrouting-dev] Regarding BFS Visitor

[Vicky Vergara]

You might want to read the visitor concept of the boost libraries
http://www.boost.org/doc/libs/1_59_0/libs/graph/doc/visitor_concepts.html

but the general idea is that an algorithm has several places that can be visited:
hope this  pseudo code helps:

foo_algorithm()
1  do_a()
2  do_users_visitors_code_0()
3  if (cond) then
4     do_c()
5     do_users_visitor_code_1()
6  else
7     do_d()
8     do_users_visitor_code_2()
9  endif

> Date: Mon, 24 Aug 2015 23:02:14 +0530
> From: rohith.reddy at research.iiit.ac.in
> To: pgrouting-dev at lists.osgeo.org
> Subject: [pgrouting-dev] Regarding BFS Visitor
> 
> Hello there,
>      Recently I started using pgrouting,and was curious to know about how different algorithms were being implemented.While going through the source code of breadth_first_search.hpp(http://www.boost.org/doc/libs/1_58_0/boost/graph/breadth_first_search.hpp),I came across the class named bfs_visitor.In every function of the visitor class I noticed a function named invoke_visitors().I explored about this,but couldnt understand,what this function does and how it was being implemented.Can anyone help me with this?
> 
> Thanks in advance.
> _______________________________________________
> pgrouting-dev mailing list
> pgrouting-dev at lists.osgeo.org
> http://lists.osgeo.org/mailman/listinfo/pgrouting-dev
 		 	   		  
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.osgeo.org/pipermail/pgrouting-dev/attachments/20150824/1db7fc99/attachment.html>