|
| Graph (CompareFunc compare, DestroyFunc vecDestroy) |
|
int | getSize () |
|
void | insertVertex (Pointer vertex) |
| Insert a vertex to the graph (if it doesn't already exist).
|
|
Vector * | getVerticesV () |
|
void | removeVertex (Pointer vertex) |
|
void | insertEdge (Pointer vertex1, Pointer vertex2) |
|
void | removeEdge (Pointer vertex1, Pointer vertex2) |
|
Vector * | getAdjacentV (Pointer vertex) |
|
Vector * | getReverseAdjacentV (Pointer vertex) |
|
Vector * | getGeneralNeighborsV (Pointer vertex) |
| Returns a vector where the K first elements are the direct neighbors of the vertex and the rest are the reverse ones.
|
|
bool | isNeighborVertex (Pointer v1, Pointer v2) |
|
CompareFunc | getCompareData () |
|
CompareFunc | getCompareVertices () |
|
DestroyFunc | getDestroyData () |
|
Vector * | getVec () |
|
◆ getGeneralNeighborsV()
Vector * Graph::getGeneralNeighborsV |
( |
Pointer |
vertex | ) |
|
Returns a vector where the K first elements are the direct neighbors of the vertex and the rest are the reverse ones.
- Parameters
-
- Returns
- Vector*
◆ insertVertex()
void Graph::insertVertex |
( |
Pointer |
vertex | ) |
|
Insert a vertex to the graph (if it doesn't already exist).
- Parameters
-
vertex | A Pointer to the vertex to be unserted. |
The documentation for this class was generated from the following files: