prg_vertex_edges_get()
Abstract
Returns a set of adjacent edges that satisfy the specified criterion
Syntax
prg_vertex_edges_get (vertex_ptr, set_type)
| Argument | Type | Description |
|---|---|---|
vertex_ptr |
PrgT_Graph_Vertex * |
Vertex of interest |
set_type |
PrgT_Graph_Element_Set_Type | Criterion defining the desired set of adjacent edges (one of the values in Table 4 Graph Package Symbolic Constants) |
Return Type
PrgT_Vector *
Vector containing the edges that meet the specified criterion
Header
prg_graph.h
Details
All of the edges that are connected to the specified vertex are considered. However, only edges that meet the specified criterion are selected. The selection criterion is given by the set_type argument, and can be any of the following:
PrgC_Graph_Element_Set_All—selects all connected edgesPrgC_Graph_Element_Set_Outgoing—selects all simplex edges departing from the specified vertex, as well as all duplex edgesPrgC_Graph_Element_Set_Incoming—selects all simplex edges arriving at the specified vertex, as well as all duplex edges
The vector that is returned contains the addresses of all of the selected edges (PrgT_Graph_Edge *). Memory management (i.e., appropriate destruction) of the vector is the responsibility of the caller. The contents of the vector should not be destroyed, as the referenced edges still belong to the graph.