|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Tests for Topological Sort. More...
#include <gtest/gtest.h>#include <set>#include <map>#include <string>#include <topological_sort.H>#include <tpl_graph.H>Go to the source code of this file.
Typedefs | |
| using | TestDigraph = Aleph::List_Digraph< Aleph::Graph_Node< std::string >, Aleph::Graph_Arc< int > > |
Functions | |
| template<class List > | |
| bool | is_valid_topological_order (const TestDigraph &g, const List &order) |
| TEST (TopologicalSortDFS, EmptyGraph) | |
| TEST (TopologicalSortDFS, SingleNode) | |
| TEST (TopologicalSortDFS, TwoNodesOneArc) | |
| TEST (TopologicalSortDFS, LinearChain) | |
| TEST (TopologicalSortDFS, DiamondDAG) | |
| TEST (TopologicalSortDFS, DisconnectedComponents) | |
| TEST (TopologicalSortDFS, ComplexDAG) | |
| TEST (TopologicalSortDFS, OperatorOverload) | |
| TEST (QTopologicalSortBFS, EmptyGraph) | |
| TEST (QTopologicalSortBFS, SingleNode) | |
| TEST (QTopologicalSortBFS, TwoNodesOneArc) | |
| TEST (QTopologicalSortBFS, LinearChain) | |
| TEST (QTopologicalSortBFS, DiamondDAG) | |
| TEST (QTopologicalSortRanks, EmptyGraph) | |
| TEST (QTopologicalSortRanks, SingleNode) | |
| TEST (QTopologicalSortRanks, LinearChain) | |
| TEST (QTopologicalSortRanks, ParallelNodes) | |
| TEST (QTopologicalSortRanks, DiamondRanks) | |
| TEST (QTopologicalSortRanks, DisconnectedComponents) | |
| TEST (QTopologicalSortOperators, PerformOverload) | |
| TEST (QTopologicalSortOperators, RanksOverloadDynDlist) | |
| TEST (QTopologicalSortOperators, RanksOverloadDynList) | |
| TEST (TopologicalSortStress, LargeDAG) | |
| TEST (TopologicalSortStress, WideDAG) | |
| TEST (TopologicalSortComparison, BothAlgorithmsProduceValidOrder) | |
Tests for Topological Sort.
Definition in file topological_sort_test.cc.
| using TestDigraph = Aleph::List_Digraph<Aleph::Graph_Node<std::string>, Aleph::Graph_Arc<int> > |
Definition at line 46 of file topological_sort_test.cc.
| bool is_valid_topological_order | ( | const TestDigraph & | g, |
| const List & | order | ||
| ) |
Definition at line 50 of file topological_sort_test.cc.
References LocateFunctions< Container, Type >::get_it(), Aleph::maps(), and Aleph::Filter_Iterator< Container, It, Show_Item >::next_ne().
Referenced by TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), and TEST().
| TEST | ( | QTopologicalSortBFS | , |
| DiamondDAG | |||
| ) |
Definition at line 279 of file topological_sort_test.cc.
References is_valid_topological_order(), and Aleph::maps().
| TEST | ( | QTopologicalSortBFS | , |
| EmptyGraph | |||
| ) |
Definition at line 225 of file topological_sort_test.cc.
References Aleph::maps().
| TEST | ( | QTopologicalSortBFS | , |
| LinearChain | |||
| ) |
Definition at line 260 of file topological_sort_test.cc.
References is_valid_topological_order(), and Aleph::maps().
| TEST | ( | QTopologicalSortBFS | , |
| SingleNode | |||
| ) |
Definition at line 234 of file topological_sort_test.cc.
References Aleph::maps().
| TEST | ( | QTopologicalSortBFS | , |
| TwoNodesOneArc | |||
| ) |
Definition at line 246 of file topological_sort_test.cc.
References is_valid_topological_order(), and Aleph::maps().
| TEST | ( | QTopologicalSortOperators | , |
| PerformOverload | |||
| ) |
Definition at line 440 of file topological_sort_test.cc.
References Aleph::maps(), and Aleph::DynDlist< T >::size().
| TEST | ( | QTopologicalSortOperators | , |
| RanksOverloadDynDlist | |||
| ) |
Definition at line 454 of file topological_sort_test.cc.
References Aleph::maps(), and Aleph::DynDlist< T >::size().
| TEST | ( | QTopologicalSortOperators | , |
| RanksOverloadDynList | |||
| ) |
Definition at line 468 of file topological_sort_test.cc.
References Aleph::maps(), and Aleph::HTList::size().
| TEST | ( | QTopologicalSortRanks | , |
| DiamondRanks | |||
| ) |
Definition at line 373 of file topological_sort_test.cc.
References Aleph::maps().
| TEST | ( | QTopologicalSortRanks | , |
| DisconnectedComponents | |||
| ) |
Definition at line 414 of file topological_sort_test.cc.
References Aleph::maps().
| TEST | ( | QTopologicalSortRanks | , |
| EmptyGraph | |||
| ) |
Definition at line 301 of file topological_sort_test.cc.
References Aleph::maps().
| TEST | ( | QTopologicalSortRanks | , |
| LinearChain | |||
| ) |
Definition at line 323 of file topological_sort_test.cc.
References Aleph::maps(), and nodes.
| TEST | ( | QTopologicalSortRanks | , |
| ParallelNodes | |||
| ) |
Definition at line 343 of file topological_sort_test.cc.
References Aleph::maps().
| TEST | ( | QTopologicalSortRanks | , |
| SingleNode | |||
| ) |
Definition at line 310 of file topological_sort_test.cc.
References Aleph::maps().
| TEST | ( | TopologicalSortComparison | , |
| BothAlgorithmsProduceValidOrder | |||
| ) |
Definition at line 537 of file topological_sort_test.cc.
References is_valid_topological_order(), Aleph::maps(), and Aleph::HTList::size().
| TEST | ( | TopologicalSortDFS | , |
| ComplexDAG | |||
| ) |
Definition at line 179 of file topological_sort_test.cc.
References is_valid_topological_order(), and Aleph::maps().
| TEST | ( | TopologicalSortDFS | , |
| DiamondDAG | |||
| ) |
Definition at line 134 of file topological_sort_test.cc.
References is_valid_topological_order(), and Aleph::maps().
| TEST | ( | TopologicalSortDFS | , |
| DisconnectedComponents | |||
| ) |
Definition at line 161 of file topological_sort_test.cc.
References is_valid_topological_order(), and Aleph::maps().
| TEST | ( | TopologicalSortDFS | , |
| EmptyGraph | |||
| ) |
Definition at line 77 of file topological_sort_test.cc.
References Aleph::maps().
| TEST | ( | TopologicalSortDFS | , |
| LinearChain | |||
| ) |
Definition at line 115 of file topological_sort_test.cc.
References is_valid_topological_order(), and Aleph::maps().
| TEST | ( | TopologicalSortDFS | , |
| OperatorOverload | |||
| ) |
Definition at line 208 of file topological_sort_test.cc.
References is_valid_topological_order(), Aleph::maps(), and Aleph::DynDlist< T >::size().
| TEST | ( | TopologicalSortDFS | , |
| SingleNode | |||
| ) |
Definition at line 86 of file topological_sort_test.cc.
References Aleph::maps().
| TEST | ( | TopologicalSortDFS | , |
| TwoNodesOneArc | |||
| ) |
Definition at line 98 of file topological_sort_test.cc.
References is_valid_topological_order(), and Aleph::maps().
| TEST | ( | TopologicalSortStress | , |
| LargeDAG | |||
| ) |
Definition at line 484 of file topological_sort_test.cc.
References Aleph::DynArray< T >::append(), is_valid_topological_order(), Aleph::maps(), N, and nodes.
| TEST | ( | TopologicalSortStress | , |
| WideDAG | |||
| ) |
Definition at line 514 of file topological_sort_test.cc.
References Aleph::Array< T >::get_first(), Aleph::Array< T >::get_last(), Aleph::maps(), Aleph::ranks(), Aleph::Array< T >::size(), and WIDTH.