![]() |
Knight's Tour Generator
Tourneys and the Fast Generation and Obfuscation of Closed Knight's Tours
|
Graph edge. More...
#include <Graph.h>
Public Member Functions | |
| CEdge (CVertex *p0, CVertex *p1, UINT index) | |
| Constructor. More... | |
| CVertex * | GetNextVertex (CVertex *p) |
| Get vertex at other end of edge. More... | |
| UINT | GetIndex () |
| Get index;. More... | |
| void | Mark (bool b=true) |
| Mark or unmark. More... | |
| bool | Marked () |
| Get mark. More... | |
| void | GetVertexIndices (UINT &i0, UINT &i1) |
| Get vertex indices. More... | |
Protected Attributes | |
| CVertex * | m_pVertex0 = nullptr |
| Vertex at one end of the edge,. | |
| CVertex * | m_pVertex1 = nullptr |
| Vertex at the other end of the edge. | |
| UINT | m_nIndex = 0 |
| Index into edge list. | |
| bool | m_bMarked = false |
| Mark flag. | |
An edge consists of pointers to two vertices, an index into the edge list, and a flag that indicates whether the edge is marked or not. There are also some neuron-related values for when the graph is used to define a neural network.
| UINT CEdge::GetIndex | ( | ) |
| void CEdge::Mark | ( | bool | b = true | ) |
1.8.15