A policy based reference counting implementation for compound objects

/////////////////////////////////
// msgrouter.hpp.hpp
//	generic message routing
//

#pragma once
#include "graphs.hpp"
#pragma message ("Compiling " __FILE__)

//define a model for routing of messages into a graph

namespace GE_ { namespace stdx { namespace graph {


	template<class Data, class Node, class Fn> //void Fn(Arc*, Data&): can be mem_fun(void(Arc::*)(Data&))
	void route_arcs(Data& d, Node& node, Fn fn)
	{
		for(typename Node::arc_iterator i = node.begin_arcto(); i!=node.end_arcto(); i++)
			Fn(i, d);
	}


	template<class Data, class Node, class Fn> //void Fn(Node*, Data&): can be mem_fun(void(Node::*)(Data&))
	void route_linked(Data& d, Node& node, Fn fn)
	{
		for(typename Node::arc_iterator i = node.begin_arcto(); i!=node.end_arcto(); i++)
		{
			Node* p(i->get_to());
			if(p) fn(p, d);
		}
	}

	template<class Data, class Node, class Fn> //void Fn(Arc*, Data&): can be mem_fun(void(Arc::*)(Data&))
	void backroute_arcs(Data& d, Node& node, Fn fn)
	{
		for(typename Node::arc_iterator i = node.begin_arcfrom(); i!=node.end_arcfrom(); i++)
			Fn(i, d);
	}


	template<class Data, class Node, class Fn> //void Fn(Node*, Data&): can be mem_fun(void(Node::*)(Data&))
	void backroute_linked(Data& d, Node& node, Fn fn)
	{
		for(typename Node::arc_iterator i = node.begin_arcfrom(); i!=node.end_arcfrom(); i++)
		{
			Node* p(i->get_to());
			if(p) fn(p, d);
		}
	}

}}}