![]() |
Knight's Tour Generator
Tourneys and the Fast Generation and Obfuscation of Closed Knight's Tours
|
Graph vertex. More...
#include <Graph.h>
Public Member Functions | |
| CVertex () | |
| Constructor. | |
| void | InsertAdjacency (CEdge *pEdge) |
| Add an edge to the edge list. More... | |
| void | SetIndex (const UINT n) |
| Set index. More... | |
| UINT | GetIndex () |
| Get index;. More... | |
| void | Mark (bool b=true) |
| Mark or unmark. More... | |
| bool | Marked () |
| Get mark. More... | |
| std::vector< CEdge * > * | GetAdjacencyList () |
| Get adjacency list. More... | |
| size_t | GetDegree () |
| Get degree. More... | |
Private Attributes | |
| std::vector< CEdge * > | m_vAdjacencyList |
| Adjacency list. | |
| UINT | m_nIndex = 0 |
| Index into vertex list. | |
| bool | m_bMarked = false |
| Mark flag. | |
A vertex consists of an adjacency list, an index into the vertex list and a flag that indicates whether the vertex is marked or not.
| std::vector< CEdge * > * CVertex::GetAdjacencyList | ( | ) |
| size_t CVertex::GetDegree | ( | ) |
| UINT CVertex::GetIndex | ( | ) |
| void CVertex::InsertAdjacency | ( | CEdge * | pEdge | ) |
| void CVertex::Mark | ( | bool | b = true | ) |
| bool CVertex::Marked | ( | ) |
1.8.15