Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
graph_scenarios_test.cc File Reference

Tests for Graph Scenarios. More...

#include <gtest/gtest.h>
#include <Bellman_Ford.H>
#include <Dijkstra.H>
#include <Tarjan.H>
#include <random_graph.H>
#include <tpl_graph.H>
#include <cstdlib>
#include <limits>
#include <random>
#include <vector>
Include dependency graph for graph_scenarios_test.cc:

Go to the source code of this file.

Functions

 TEST (GraphScenarios, DisconnectedGraph_UnreachablePath)
 
 TEST (GraphScenarios, Multigraph_ParallelArcs_DijkstraChoosesMin)
 
 TEST (GraphScenarios, BellmanFord_NegativeWeights_NoNegativeCycle)
 
 TEST (GraphScenarios, SparseVsDense_DijkstraMatchesBellmanFord)
 
 TEST (GraphScenarios, MultiGraph_TarjanCycleDetection)
 

Detailed Description

Tests for Graph Scenarios.

Definition in file graph_scenarios_test.cc.

Function Documentation

◆ TEST() [1/5]

TEST ( GraphScenarios  ,
BellmanFord_NegativeWeights_NoNegativeCycle   
)

Definition at line 234 of file graph_scenarios_test.cc.

References Aleph::Path< GT >::is_empty(), and Aleph::maps().

◆ TEST() [2/5]

TEST ( GraphScenarios  ,
DisconnectedGraph_UnreachablePath   
)

Definition at line 185 of file graph_scenarios_test.cc.

References Aleph::Path< GT >::is_empty(), and Aleph::maps().

◆ TEST() [3/5]

TEST ( GraphScenarios  ,
Multigraph_ParallelArcs_DijkstraChoosesMin   
)

Definition at line 207 of file graph_scenarios_test.cc.

References Aleph::Path< GT >::is_empty(), and Aleph::maps().

◆ TEST() [4/5]

TEST ( GraphScenarios  ,
MultiGraph_TarjanCycleDetection   
)

Definition at line 292 of file graph_scenarios_test.cc.

References Aleph::maps().

◆ TEST() [5/5]

TEST ( GraphScenarios  ,
SparseVsDense_DijkstraMatchesBellmanFord   
)

Definition at line 258 of file graph_scenarios_test.cc.

References Aleph::maps(), and N.