snode Struct Reference

a node of search graph sgraph, is created as a border segment between two adjusted cells of type cell. More...

#include <sgraph.h>

Collaboration diagram for snode:

Data Fields
int	n_val
int	n_idx
snode *	n_dad
sedge *	n_edge
short	n_adj
short	save_n_adj
struct cell *	cells [2]
	[0] - left or botom, [1] - top or right adjusted cell
int *	adj_edge_list
	edges incident on this node – stored as indices of the edges array in the graph
int	index
bool	isVert

Detailed Description

Nodes and a search graph are created by functions mkMazeGraph, findSVert and createSNode.

Definition at line 26 of file sgraph.h.

Field Documentation

adj_edge_list

int* snode::adj_edge_list

Definition at line 37 of file sgraph.h.

Referenced by addEdgeToNode(), freeSGraph(), initSEdges(), and shortPath().

cells

struct cell* snode::cells[2]

Definition at line 32 of file sgraph.h.

Referenced by addLoop(), addNodeEdges(), cellOf(), chkSgraph(), convertSPtoRoute(), emitSearchGraph(), extractHChans(), extractVChans(), markSmall(), mkMazeGraph(), and sidePt().

index

int snode::index

Definition at line 38 of file sgraph.h.

Referenced by adjacentNode(), createSEdge(), createSNode(), findSVert(), mkMazeGraph(), PQprint(), and shortPath().

isVert

bool snode::isVert

Definition at line 39 of file sgraph.h.

Referenced by addLoop(), convertSPtoRoute(), findSVert(), markSmall(), and sidePt().

n_adj

short snode::n_adj

Definition at line 30 of file sgraph.h.

Referenced by addEdgeToNode(), and shortPath().

n_dad

snode* snode::n_dad

Definition at line 28 of file sgraph.h.

n_edge

sedge* snode::n_edge

Definition at line 29 of file sgraph.h.

n_idx

int snode::n_idx

Definition at line 27 of file sgraph.h.

Referenced by PQupdate().

n_val

int snode::n_val

Definition at line 27 of file sgraph.h.

Referenced by PQupheap().

save_n_adj

short snode::save_n_adj

Definition at line 31 of file sgraph.h.

---

The documentation for this struct was generated from the following file:

• lib/ortho/sgraph.h