|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Tests for Test Kosaraju. More...
Go to the source code of this file.
Typedefs | |
| using | GT = List_Digraph< Graph_Node< int >, Graph_Arc< int > > |
| using | Node = GT::Node |
| using | Arc = GT::Arc |
Functions | |
| GT | create_chain (size_t n) |
| GT | create_cycle (size_t n) |
| size_t | count_total_nodes (const DynList< DynList< Node * > > &sccs) |
| TEST (KosarajuTest, EmptyGraph) | |
| TEST (KosarajuTest, SingleNode) | |
| TEST (KosarajuTest, SingleNodeWithSelfLoop) | |
| TEST (KosarajuTest, TwoDisconnectedNodes) | |
| TEST (KosarajuTest, SimpleChain) | |
| TEST (KosarajuTest, SimpleCycle) | |
| TEST (KosarajuTest, TwoSeparateCycles) | |
| TEST (KosarajuTest, TwoCyclesConnectedByOneArc) | |
| TEST (KosarajuTest, TwoCyclesConnectedBidirectionally) | |
| TEST (KosarajuTest, ClassicCLRSExample) | |
| TEST (KosarajuTest, SubgraphVersion) | |
| TEST (KosarajuTest, CrossArcListCorrectness) | |
| TEST (KosarajuTest, IsStronglyConnectedTrue) | |
| TEST (KosarajuTest, IsStronglyConnectedFalse) | |
| TEST (KosarajuTest, IsStronglyConnectedEmpty) | |
| TEST (KosarajuTest, IsStronglyConnectedSingleNode) | |
| TEST (KosarajuTest, SccCount) | |
| TEST (KosarajuTest, FunctorInterface) | |
| TEST (KosarajuTest, LargeChain) | |
| TEST (KosarajuTest, LargeCycle) | |
| TEST (KosarajuTest, NodeMappingCorrectness) | |
| TEST (KosarajuTest, ArcMappingCorrectness) | |
| TEST (KosarajuTest, DiamondGraph) | |
| TEST (KosarajuTest, CompleteDigraph) | |
| TEST (KosarajuTest, MultipleSelfLoops) | |
| TEST (KosarajuTest, TreeStructure) | |
| TEST (KosarajuTest, CompareWithTarjan) | |
| TEST (KosarajuTest, StressTest) | |
| TEST (KosarajuTest, IsolatedNodesAndSCCs) | |
| TEST (KosarajuTest, ParallelArcs) | |
| TEST (KosarajuTest, DenseGraphPerformance) | |
| TEST (KosarajuTest, MultipleLoopsOnSameNode) | |
| TEST (KosarajuTest, NodesWithoutArcs) | |
| TEST (KosarajuTest, FullyBidirectionalGraph) | |
| TEST (KosarajuTest, TransposedCycleCorrectness) | |
| int | main (int argc, char **argv) |
Tests for Test Kosaraju.
Definition in file test_kosaraju.cc.
Definition at line 56 of file test_kosaraju.cc.
| using GT = List_Digraph<Graph_Node<int>, Graph_Arc<int> > |
Definition at line 54 of file test_kosaraju.cc.
Definition at line 55 of file test_kosaraju.cc.
Definition at line 83 of file test_kosaraju.cc.
References Aleph::count(), Aleph::maps(), and Aleph::HTList::size().
| GT create_chain | ( | size_t | n | ) |
Definition at line 61 of file test_kosaraju.cc.
References Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), and nodes.
| GT create_cycle | ( | size_t | n | ) |
Definition at line 72 of file test_kosaraju.cc.
References Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), and nodes.
Referenced by TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), and TEST().
| int main | ( | int | argc, |
| char ** | argv | ||
| ) |
Definition at line 754 of file test_kosaraju.cc.
References Aleph::maps().
| TEST | ( | KosarajuTest | , |
| ArcMappingCorrectness | |||
| ) |
| TEST | ( | KosarajuTest | , |
| ClassicCLRSExample | |||
| ) |
Definition at line 234 of file test_kosaraju.cc.
References count_total_nodes(), h, Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::kosaraju_connected_components(), Aleph::maps(), and Aleph::HTList::size().
| TEST | ( | KosarajuTest | , |
| CompareWithTarjan | |||
| ) |
Definition at line 576 of file test_kosaraju.cc.
References Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::kosaraju_connected_components(), Aleph::maps(), and Aleph::HTList::size().
| TEST | ( | KosarajuTest | , |
| CompleteDigraph | |||
| ) |
Definition at line 509 of file test_kosaraju.cc.
References Aleph::DynList< T >::get_first(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::kosaraju_connected_components(), Aleph::maps(), nodes, and Aleph::HTList::size().
| TEST | ( | KosarajuTest | , |
| CrossArcListCorrectness | |||
| ) |
Definition at line 309 of file test_kosaraju.cc.
References Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::kosaraju_connected_components(), Aleph::maps(), and Aleph::HTList::size().
| TEST | ( | KosarajuTest | , |
| DenseGraphPerformance | |||
| ) |
Definition at line 661 of file test_kosaraju.cc.
References Aleph::DynList< T >::get_first(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::kosaraju_connected_components(), Aleph::maps(), N, nodes, and Aleph::HTList::size().
| TEST | ( | KosarajuTest | , |
| DiamondGraph | |||
| ) |
Definition at line 482 of file test_kosaraju.cc.
References Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::kosaraju_connected_components(), Aleph::maps(), and Aleph::HTList::size().
| TEST | ( | KosarajuTest | , |
| EmptyGraph | |||
| ) |
Definition at line 91 of file test_kosaraju.cc.
References Aleph::kosaraju_connected_components(), Aleph::maps(), and Aleph::HTList::size().
| TEST | ( | KosarajuTest | , |
| FullyBidirectionalGraph | |||
| ) |
Definition at line 716 of file test_kosaraju.cc.
References Aleph::DynList< T >::get_first(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::kosaraju_connected_components(), Aleph::maps(), nodes, and Aleph::HTList::size().
| TEST | ( | KosarajuTest | , |
| FunctorInterface | |||
| ) |
Definition at line 390 of file test_kosaraju.cc.
References create_cycle(), Aleph::DynList< T >::get_first(), Aleph::maps(), and Aleph::HTList::size().
| TEST | ( | KosarajuTest | , |
| IsolatedNodesAndSCCs | |||
| ) |
Definition at line 623 of file test_kosaraju.cc.
References Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::kosaraju_connected_components(), Aleph::maps(), and Aleph::HTList::size().
| TEST | ( | KosarajuTest | , |
| IsStronglyConnectedEmpty | |||
| ) |
Definition at line 359 of file test_kosaraju.cc.
References Aleph::is_strongly_connected(), and Aleph::maps().
| TEST | ( | KosarajuTest | , |
| IsStronglyConnectedFalse | |||
| ) |
Definition at line 352 of file test_kosaraju.cc.
References create_chain(), Aleph::is_strongly_connected(), and Aleph::maps().
| TEST | ( | KosarajuTest | , |
| IsStronglyConnectedSingleNode | |||
| ) |
Definition at line 366 of file test_kosaraju.cc.
References Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::is_strongly_connected(), and Aleph::maps().
| TEST | ( | KosarajuTest | , |
| IsStronglyConnectedTrue | |||
| ) |
Definition at line 345 of file test_kosaraju.cc.
References create_cycle(), Aleph::is_strongly_connected(), and Aleph::maps().
| TEST | ( | KosarajuTest | , |
| LargeChain | |||
| ) |
Definition at line 409 of file test_kosaraju.cc.
References create_chain(), Aleph::kosaraju_connected_components(), Aleph::maps(), and Aleph::HTList::size().
| TEST | ( | KosarajuTest | , |
| LargeCycle | |||
| ) |
Definition at line 418 of file test_kosaraju.cc.
References create_cycle(), Aleph::DynList< T >::get_first(), Aleph::kosaraju_connected_components(), Aleph::maps(), and Aleph::HTList::size().
| TEST | ( | KosarajuTest | , |
| MultipleLoopsOnSameNode | |||
| ) |
| TEST | ( | KosarajuTest | , |
| MultipleSelfLoops | |||
| ) |
Definition at line 530 of file test_kosaraju.cc.
References Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::kosaraju_connected_components(), Aleph::maps(), and Aleph::HTList::size().
| TEST | ( | KosarajuTest | , |
| NodeMappingCorrectness | |||
| ) |
| TEST | ( | KosarajuTest | , |
| NodesWithoutArcs | |||
| ) |
Definition at line 699 of file test_kosaraju.cc.
References Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::kosaraju_connected_components(), Aleph::maps(), N, and Aleph::HTList::size().
| TEST | ( | KosarajuTest | , |
| ParallelArcs | |||
| ) |
| TEST | ( | KosarajuTest | , |
| SccCount | |||
| ) |
Definition at line 374 of file test_kosaraju.cc.
References Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::kosaraju_scc_count(), and Aleph::maps().
| TEST | ( | KosarajuTest | , |
| SimpleChain | |||
| ) |
Definition at line 136 of file test_kosaraju.cc.
References create_chain(), Aleph::kosaraju_connected_components(), Aleph::maps(), and Aleph::HTList::size().
| TEST | ( | KosarajuTest | , |
| SimpleCycle | |||
| ) |
Definition at line 146 of file test_kosaraju.cc.
References create_cycle(), Aleph::DynList< T >::get_first(), Aleph::kosaraju_connected_components(), Aleph::maps(), and Aleph::HTList::size().
| TEST | ( | KosarajuTest | , |
| SingleNode | |||
| ) |
Definition at line 100 of file test_kosaraju.cc.
References Aleph::DynList< T >::get_first(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::kosaraju_connected_components(), Aleph::maps(), and Aleph::HTList::size().
| TEST | ( | KosarajuTest | , |
| SingleNodeWithSelfLoop | |||
| ) |
| TEST | ( | KosarajuTest | , |
| StressTest | |||
| ) |
Definition at line 604 of file test_kosaraju.cc.
References Aleph::DynList< T >::get_first(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::kosaraju_connected_components(), Aleph::maps(), N, nodes, and Aleph::HTList::size().
| TEST | ( | KosarajuTest | , |
| SubgraphVersion | |||
| ) |
| TEST | ( | KosarajuTest | , |
| TransposedCycleCorrectness | |||
| ) |
Definition at line 737 of file test_kosaraju.cc.
References create_chain(), Aleph::kosaraju_connected_components(), Aleph::maps(), and Aleph::HTList::size().
| TEST | ( | KosarajuTest | , |
| TreeStructure | |||
| ) |
Definition at line 548 of file test_kosaraju.cc.
References Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::kosaraju_connected_components(), Aleph::maps(), and Aleph::HTList::size().
| TEST | ( | KosarajuTest | , |
| TwoCyclesConnectedBidirectionally | |||
| ) |
| TEST | ( | KosarajuTest | , |
| TwoCyclesConnectedByOneArc | |||
| ) |
Definition at line 182 of file test_kosaraju.cc.
References Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::kosaraju_connected_components(), Aleph::maps(), and Aleph::HTList::size().
| TEST | ( | KosarajuTest | , |
| TwoDisconnectedNodes | |||
| ) |
Definition at line 123 of file test_kosaraju.cc.
References count_total_nodes(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::kosaraju_connected_components(), Aleph::maps(), and Aleph::HTList::size().
| TEST | ( | KosarajuTest | , |
| TwoSeparateCycles | |||
| ) |