Lines Matching full:vertex
2638 // Initial O(N) pass. Make a forest of single-vertex trees.
2927 /* Add a vertex to a graph: */
2931 CvGraphVtx *vertex = 0;
2941 vertex = (CvGraphVtx*)cvSetNew((CvSet*)graph);
2942 if( vertex )
2945 CV_MEMCPY_INT( vertex + 1, _vertex + 1,
2947 vertex->first = 0;
2948 index = vertex->flags;
2952 *_inserted_vertex = vertex;
2960 /* Remove a vertex from the graph together with its incident edges: */
2974 CV_ERROR( CV_StsBadArg, "The vertex does not belong to the graph" );
2993 /* Remove a vertex from the graph together with its incident edges: */
3009 CV_ERROR( CV_StsBadArg, "The vertex is not found" );
3135 "vertex pointers coinside (or set to NULL)" );
3290 /* Count number of edges incident to a given vertex: */
3292 cvGraphVtxDegreeByPtr( const CvGraph* graph, const CvGraphVtx* vertex )
3301 if( !graph || !vertex )
3304 for( edge = vertex->first, count = 0; edge; )
3307 edge = CV_NEXT_GRAPH_EDGE( edge, vertex );
3316 /* Count number of edges incident to a given vertex: */
3320 CvGraphVtx *vertex;
3331 vertex = cvGetGraphVtx( graph, vtx_idx );
3332 if( !vertex )
3335 for( edge = vertex->first, count = 0; edge; )
3338 edge = CV_NEXT_GRAPH_EDGE( edge, vertex );
