HamiltonianUndirectedTest Class Reference

Inheritance diagram for HamiltonianUndirectedTest:

Collaboration diagram for HamiltonianUndirectedTest:

Protected Types
using	Graph = List_Graph< Graph_Node< int >, Graph_Arc< int > >
using	Node = Graph::Node
using	Arc = Graph::Arc

Protected Member Functions
Node *	add_node (int val)
Arc *	add_edge (Node *n1, Node *n2)
void	build_complete_graph (int n)

Protected Attributes
Graph	g

Detailed Description

Definition at line 51 of file hamiltonian_test.cc.

Member Typedef Documentation

Arc

using HamiltonianUndirectedTest::Arc = Graph::Arc

protected

Definition at line 56 of file hamiltonian_test.cc.

Graph

using HamiltonianUndirectedTest::Graph = List_Graph<Graph_Node<int>, Graph_Arc<int> >

protected

Definition at line 54 of file hamiltonian_test.cc.

Node

using HamiltonianUndirectedTest::Node = Graph::Node

protected

Definition at line 55 of file hamiltonian_test.cc.

Member Function Documentation

add_edge()

Arc * HamiltonianUndirectedTest::add_edge ( Node *  n1, Node *  n2  )

inlineprotected

Definition at line 65 of file hamiltonian_test.cc.

References g, and Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc().

Referenced by build_complete_graph().

add_node()

Node * HamiltonianUndirectedTest::add_node ( int  val )

inlineprotected

Definition at line 60 of file hamiltonian_test.cc.

References g, and Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node().

Referenced by build_complete_graph().

build_complete_graph()

void HamiltonianUndirectedTest::build_complete_graph ( int  n )

inlineprotected

Definition at line 71 of file hamiltonian_test.cc.

References add_edge(), add_node(), and nodes.

Member Data Documentation

g

Graph HamiltonianUndirectedTest::g

protected

Definition at line 58 of file hamiltonian_test.cc.

Referenced by add_edge(), and add_node().

---

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

• Tests/hamiltonian_test.cc