Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
FloydSimpleGraphTest Class Reference

Test fixture with a simple weighted graph. More...

Inheritance diagram for FloydSimpleGraphTest:
[legend]
Collaboration diagram for FloydSimpleGraphTest:
[legend]

Protected Types

using Graph = List_Digraph< Graph_Node< int >, Graph_Arc< DistanceArc > >
 
using Node = Graph::Node
 
using Arc = Graph::Arc
 
using Dist = DistanceArc::Distance_Type
 

Protected Member Functions

void SetUp () override
 
long get_index (Ady_Mat< Graph, Dist > &mat, Node *node) const
 

Protected Attributes

Graph g
 
Noden0
 
Noden1
 
Noden2
 
Noden3
 

Detailed Description

Test fixture with a simple weighted graph.

Definition at line 103 of file latex_floyd_test.cc.

Member Typedef Documentation

◆ Arc

Definition at line 108 of file latex_floyd_test.cc.

◆ Dist

◆ Graph

◆ Node

Definition at line 107 of file latex_floyd_test.cc.

Member Function Documentation

◆ get_index()

long FloydSimpleGraphTest::get_index ( Ady_Mat< Graph, Dist > &  mat,
Node node 
) const
inlineprotected

◆ SetUp()

void FloydSimpleGraphTest::SetUp ( )
inlineoverrideprotected

Definition at line 117 of file latex_floyd_test.cc.

References g, n0, n1, n2, and n3.

Member Data Documentation

◆ g

Graph FloydSimpleGraphTest::g
protected

Definition at line 111 of file latex_floyd_test.cc.

Referenced by SetUp().

◆ n0

Node* FloydSimpleGraphTest::n0
protected

Definition at line 112 of file latex_floyd_test.cc.

Referenced by SetUp().

◆ n1

Node* FloydSimpleGraphTest::n1
protected

Definition at line 113 of file latex_floyd_test.cc.

Referenced by SetUp().

◆ n2

Node* FloydSimpleGraphTest::n2
protected

Definition at line 114 of file latex_floyd_test.cc.

Referenced by SetUp().

◆ n3

Node* FloydSimpleGraphTest::n3
protected

Definition at line 115 of file latex_floyd_test.cc.

Referenced by SetUp().


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