60 std::vector<LinguisticGraphVertex>& concatenated=m_concatVertices.back();
61 if (concatenated.size()>0)
63 add_edge(concatenated.back(),componentVertex,*m_graph);
65 concatenated.push_back(componentVertex);
67 m_currentToken=
new Token(form,(*m_stringsPool)[form],m_srcToken->
position()+position,length,m_srcToken->
status());
68 put(
vertex_token,*m_graph,componentVertex,m_currentToken);
70 put(
vertex_data,*m_graph,componentVertex,m_currentData);
boost::adjacency_list< boost::vecS, boost::vecS, boost::bidirectionalS, LinguisticVertexProperties > LinguisticGraph
Property to identify the chains in the graph.