Clave Struct Reference

Key structure for DFS tree nodes. More...

#include <generate_df_tree.H>

Public Member Functions
int	operator() (BinNode< int > *p) const

Public Attributes
int	key
	Original node identifier.
long	count
	DFS discovery number (pre-order)
long	low
	Low-link value (minimum reachable via back edges)

Detailed Description

Key structure for DFS tree nodes.

Stores the essential information for each node in a depth-first spanning tree visualization.

Definition at line 82 of file testBinNodeUtils.C.

Member Function Documentation

operator()()

int Clave::operator() ( BinNode< int > *  p ) const

inline

Definition at line 84 of file testBinNodeUtils.C.

References Aleph::BinNode< Key >::get_key().

Member Data Documentation

count

long Clave::count

DFS discovery number (pre-order)

Definition at line 81 of file generate_df_tree.H.

Referenced by TEST_F(), TEST_F(), and TEST_F().

key

int Clave::key

Original node identifier.

Definition at line 80 of file generate_df_tree.H.

Referenced by TEST_F(), TEST_F(), and TEST_F().

low

long Clave::low

Low-link value (minimum reachable via back edges)

Definition at line 82 of file generate_df_tree.H.

Referenced by TEST_F(), TEST_F(), TEST_F(), and TEST_F().

---

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

• Examples/testBinNodeUtils.C
• generate_df_tree.H
• Tests/generate_df_tree_test.cc