Lines Matching refs:vtx
171 CvTsSimpleSet* vtx;
177 int max_vtx_count = graph->vtx->max_count;
178 cvTsClearSimpleSet( graph->vtx );
191 graph->vtx = cvTsCreateSimpleSet( max_vtx_count, vtx_size );
205 cvTsReleaseSimpleSet( &(graph[0]->vtx) );
213 return cvTsSimpleSetAdd( graph->vtx, vertex );
219 int i, max_vtx_count = graph->vtx->max_count;
221 cvTsSimpleSetRemove( graph->vtx, index );
236 assert( cvTsSimpleSetFind( graph->vtx, idx1 ) &&
237 cvTsSimpleSetFind( graph->vtx, idx2 ));
241 int ofs = (idx1*graph->vtx->max_count + idx2)*graph->edge_size;
256 assert( cvTsSimpleSetFind( graph->vtx, idx1 ) &&
257 cvTsSimpleSetFind( graph->vtx, idx2 ));
261 int ofs = (idx1*graph->vtx->max_count + idx2)*graph->edge_size;
271 return cvTsSimpleSetFind( graph->vtx, index );
280 char* edge = graph->matrix + (idx1 * graph->vtx->max_count + idx2)*graph->edge_size;
291 int max_vtx_count = graph->vtx->max_count;
1448 CvGraphVtx *vtx = 0, *vtx2 = 0, *vtx3 = 0;
1471 int pure_vtx_size = sgraph->vtx->elem_size - 1,
1500 if( sgraph->vtx->free_count == 0 )
1512 vtx = (CvGraphVtx*)&elem_buf[0];
1513 idx0 = cvTsSimpleGraphAddVertex( sgraph, vtx + 1 );
1516 idx = cvGraphAddVtx( graph, pass_data ? vtx : 0, &vtx2 );
1519 memcpy( vtx2 + 1, vtx + 1, pure_vtx_size );
1526 memcmp(vtx3 + 1, vtx + 1, pure_vtx_size) == 0)),
1536 idx = cvtest::randInt(rng) % sgraph->vtx->max_count;
1537 if( sgraph->vtx->free_count == sgraph->vtx->max_count || idx >= sgraph->vtx->count )
1547 vtx = cvGetGraphVtx( graph, idx );
1548 CV_TS_SEQ_CHECK_CONDITION( CV_IS_SET_ELEM(vtx) && vtx->flags == idx &&
1549 (pure_vtx_size == 0 || memcmp( vtx + 1, vtx_data, pure_vtx_size) == 0),
1554 vtx_degree = cvGraphVtxDegreeByPtr( graph, vtx );
1555 cvGraphRemoveVtxByPtr( graph, vtx );
1568 CV_TS_SEQ_CHECK_CONDITION( !CV_IS_SET_ELEM(vtx) && !cvGetGraphVtx(graph, idx) &&
1569 (vtx->flags & CV_SET_ELEM_IDX_MASK) == idx,
1576 CV_TS_SEQ_CHECK_CONDITION( ((CvSetElem*)vtx)->next_free == first_free &&
1577 graph->free_elems == (CvSetElem*)vtx &&
1586 if( sgraph->vtx->free_count >= sgraph->vtx->max_count-1 )
1591 int j = cvtest::randInt(rng) % sgraph->vtx->count;
1629 vtx = cvGetGraphVtx( graph, v_idx[0] );
1631 CV_TS_SEQ_CHECK_CONDITION( vtx != 0 && vtx2 != 0 && vtx->flags == v_idx[0] &&
1636 v_prev_degree[0] = cvGraphVtxDegreeByPtr( graph, vtx );
1638 res = cvGraphAddEdgeByPtr(graph, vtx, vtx2, pass_data ? edge : 0, &edge2);
1639 v_degree[0] = cvGraphVtxDegreeByPtr( graph, vtx );
1653 ((edge2->vtx[0] == vtx && edge2->vtx[1] == vtx2) ||
1654 (!CV_IS_GRAPH_ORIENTED(graph) && edge2->vtx[0] == vtx2 && edge2->vtx[1] == vtx)) &&
1681 if( sgraph->vtx->free_count >= sgraph->vtx->max_count-1 )
1687 int j = cvtest::randInt(rng) % sgraph->vtx->count;
1712 vtx = cvGetGraphVtx( graph, v_idx[0] );
1714 CV_TS_SEQ_CHECK_CONDITION( vtx != 0 && vtx2 != 0 && vtx->flags == v_idx[0] &&
1719 edge = cvFindGraphEdgeByPtr( graph, vtx, vtx2 );
1720 v_prev_degree[0] = cvGraphVtxDegreeByPtr( graph, vtx );
1733 ((edge->vtx[0] == vtx && edge->vtx[1] == vtx2) ||
1734 (!CV_IS_GRAPH_ORIENTED(graph) && edge->vtx[1] == vtx && edge->vtx[0] == vtx2)) &&
1740 cvGraphRemoveEdgeByPtr( graph, vtx, vtx2 );
1741 edge2 = cvFindGraphEdgeByPtr( graph, vtx, vtx2 );
1742 v_degree[0] = cvGraphVtxDegreeByPtr( graph, vtx );
1771 CV_TS_SEQ_CHECK_CONDITION( graph->active_count == sgraph->vtx->max_count - sgraph->vtx->free_count &&
1979 a = cvGraphVtxIdx( graph, scanner->vtx );
1986 a = cvGraphVtxIdx( graph, scanner->vtx );
1994 a = cvGraphVtxIdx( graph, scanner->vtx );
2002 a = cvGraphVtxIdx( graph, scanner->vtx );
2010 a = cvGraphVtxIdx( graph, scanner->vtx );
2015 a = cvGraphVtxIdx( graph, scanner->vtx );
2084 int vtx_idx = scanner->vtx->flags & CV_SET_ELEM_IDX_MASK;
2088 "The vtx is not found or visited for the second time" );
