Снег. Keeps the dream alive.

#include <boost/graph/adjacency_list.hpp>
 
struct Motion
{
	std::string filename;
	int frames;
	std::vector< std::vector<double> > data;
};
 
struct Transition
{
	unsigned frame_in;
	unsigned frame_out;
};
 
 
int main( void )
{
	using namespace boost;
 
	typedef adjacency_list<listS, listS, bidirectionalS, Motion, Transition> Graph;
 
	Graph motion_graph;
 
	Motion m;
	m.filename = "hello";
	m.frames = 55;
 
	Motion f;
	f.filename = "bye";
	f.frames = 15;
 
	Graph::vertex_descriptor one = add_vertex( m, motion_graph );
	Graph::vertex_descriptor two = add_vertex( f, motion_graph );
 
	Transition s;
	s.frame_in = 12;
	s.frame_out = 11;
 
	add_edge( one, two, s, motion_graph );
 
	pair<Graph::vertex_iterator, Graph::vertex_iterator> vs = vertices( motion_graph );
 
	for( vs.first; vs.first != vs.second; vs.first++ )
	{
                Graph::vertex_descriptor i = *( vs.first );
		std::cout << motion_graph[i].filename << " " << motion_graph[i].frames << std::endl;
 
                std::cout << "Edges: " << std::endl;
		std::pair<Graph::out_edge_iterator, Graph::out_edge_iterator> es = out_edges( i, motion_graph );
 
		for( es.first; es.first != es.second; es.first++ )
		{
                        Graph::edge_descriptor j = *( es.first );
			Graph::vertex_descriptor t = target( j, motion_graph );
			std::cout << "Edge from " << motion_graph[i].filename << " to " << motion_graph[t].filename << std::endl;
			std::cout << motion_graph[j].frame_in << " " << motion_graph[j].frame_out << std::endl;
		}
 
	}
 
	return 0;
}