|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Tests for Tpl Spanning Tree. More...
#include <gtest/gtest.h>#include <tpl_spanning_tree.H>#include <tpl_graph.H>#include <tpl_sgraph.H>#include <tpl_agraph.H>Go to the source code of this file.
Classes | |
| class | DFSSpanningTreeTest |
| class | BFSSpanningTreeTest |
| class | SpanningTreeAllGraphs< GraphType > |
| class | SpanningTreeUndirectedGraphs< GraphType > |
Typedefs | |
| using | ListGraph = List_Graph< Graph_Node< int >, Graph_Arc< int > > |
| using | ListDigraph = List_Digraph< Graph_Node< int >, Graph_Arc< int > > |
| using | SparseGraph = List_SGraph< Graph_Snode< int >, Graph_Sarc< int > > |
| using | SparseDigraph = List_SDigraph< Graph_Snode< int >, Graph_Sarc< int > > |
| using | ArrayGraph = Array_Graph< Graph_Anode< int >, Graph_Aarc< int > > |
| using | ArrayDigraph = Array_Digraph< Graph_Anode< int >, Graph_Aarc< int > > |
| using | GraphTypes = ::testing::Types< ListGraph, ListDigraph, SparseGraph, SparseDigraph, ArrayGraph, ArrayDigraph > |
| using | UndirectedGraphTypes = ::testing::Types< ListGraph, SparseGraph, ArrayGraph > |
Tests for Tpl Spanning Tree.
Definition in file tpl_spanning_tree_test.cc.
| using ArrayDigraph = Array_Digraph<Graph_Anode<int>, Graph_Aarc<int> > |
Definition at line 72 of file tpl_spanning_tree_test.cc.
| using ArrayGraph = Array_Graph<Graph_Anode<int>, Graph_Aarc<int> > |
Definition at line 71 of file tpl_spanning_tree_test.cc.
| using GraphTypes = ::testing::Types< ListGraph, ListDigraph, SparseGraph, SparseDigraph, ArrayGraph, ArrayDigraph > |
Definition at line 425 of file tpl_spanning_tree_test.cc.
| using ListDigraph = List_Digraph<Graph_Node<int>, Graph_Arc<int> > |
Definition at line 64 of file tpl_spanning_tree_test.cc.
| using ListGraph = List_Graph<Graph_Node<int>, Graph_Arc<int> > |
Definition at line 63 of file tpl_spanning_tree_test.cc.
| using SparseDigraph = List_SDigraph<Graph_Snode<int>, Graph_Sarc<int> > |
Definition at line 68 of file tpl_spanning_tree_test.cc.
| using SparseGraph = List_SGraph<Graph_Snode<int>, Graph_Sarc<int> > |
Definition at line 67 of file tpl_spanning_tree_test.cc.
| using UndirectedGraphTypes = ::testing::Types< ListGraph, SparseGraph, ArrayGraph > |
Definition at line 445 of file tpl_spanning_tree_test.cc.
| int main | ( | int | argc, |
| char ** | argv | ||
| ) |
Definition at line 626 of file tpl_spanning_tree_test.cc.
References Aleph::maps().
| TEST_F | ( | BFSSpanningTreeTest | , |
| CompleteGraph | |||
| ) |
Definition at line 288 of file tpl_spanning_tree_test.cc.
References Aleph::DynArray< T >::append(), Aleph::maps(), N, nodes, and root().
| TEST_F | ( | BFSSpanningTreeTest | , |
| EmptyGraphThrows | |||
| ) |
Definition at line 323 of file tpl_spanning_tree_test.cc.
References Aleph::maps().
| TEST_F | ( | BFSSpanningTreeTest | , |
| FromSpecificNode | |||
| ) |
Definition at line 308 of file tpl_spanning_tree_test.cc.
References Aleph::maps().
| TEST_F | ( | BFSSpanningTreeTest | , |
| LargeGraph | |||
| ) |
Definition at line 391 of file tpl_spanning_tree_test.cc.
References Aleph::DynArray< T >::append(), Aleph::maps(), N, nodes, and root().
| TEST_F | ( | BFSSpanningTreeTest | , |
| NodeMapping | |||
| ) |
Definition at line 339 of file tpl_spanning_tree_test.cc.
References Aleph::maps().
| TEST_F | ( | BFSSpanningTreeTest | , |
| NullptrNodeThrows | |||
| ) |
Definition at line 330 of file tpl_spanning_tree_test.cc.
References Aleph::maps().
| TEST_F | ( | BFSSpanningTreeTest | , |
| SingleNode | |||
| ) |
Definition at line 245 of file tpl_spanning_tree_test.cc.
References Aleph::maps(), and root().
| TEST_F | ( | BFSSpanningTreeTest | , |
| TriangleGraph | |||
| ) |
Definition at line 271 of file tpl_spanning_tree_test.cc.
References Aleph::maps(), and root().
| TEST_F | ( | BFSSpanningTreeTest | , |
| TwoNodesConnected | |||
| ) |
Definition at line 257 of file tpl_spanning_tree_test.cc.
References Aleph::maps(), and root().
| TEST_F | ( | DFSSpanningTreeTest | , |
| CompleteGraph | |||
| ) |
Definition at line 162 of file tpl_spanning_tree_test.cc.
References Aleph::DynArray< T >::append(), Aleph::maps(), N, nodes, and root().
| TEST_F | ( | DFSSpanningTreeTest | , |
| EmptyGraphThrows | |||
| ) |
Definition at line 199 of file tpl_spanning_tree_test.cc.
References Aleph::maps().
| TEST_F | ( | DFSSpanningTreeTest | , |
| FromSpecificNode | |||
| ) |
Definition at line 183 of file tpl_spanning_tree_test.cc.
References Aleph::maps().
| TEST_F | ( | DFSSpanningTreeTest | , |
| LargeGraph | |||
| ) |
Definition at line 367 of file tpl_spanning_tree_test.cc.
References Aleph::DynArray< T >::append(), Aleph::maps(), N, nodes, and root().
| TEST_F | ( | DFSSpanningTreeTest | , |
| LinearChain | |||
| ) |
Definition at line 141 of file tpl_spanning_tree_test.cc.
References Aleph::maps(), and root().
| TEST_F | ( | DFSSpanningTreeTest | , |
| NodeMapping | |||
| ) |
Definition at line 215 of file tpl_spanning_tree_test.cc.
References Aleph::maps().
| TEST_F | ( | DFSSpanningTreeTest | , |
| NullptrNodeThrows | |||
| ) |
Definition at line 206 of file tpl_spanning_tree_test.cc.
References Aleph::maps().
| TEST_F | ( | DFSSpanningTreeTest | , |
| SingleNode | |||
| ) |
Definition at line 98 of file tpl_spanning_tree_test.cc.
References Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::maps(), and root().
| TEST_F | ( | DFSSpanningTreeTest | , |
| TriangleGraph | |||
| ) |
Definition at line 124 of file tpl_spanning_tree_test.cc.
References Aleph::maps(), and root().
| TEST_F | ( | DFSSpanningTreeTest | , |
| TwoNodesConnected | |||
| ) |
Definition at line 110 of file tpl_spanning_tree_test.cc.
References Aleph::maps(), and root().
| TYPED_TEST | ( | SpanningTreeAllGraphs | , |
| BFSEmptyGraphThrows | |||
| ) |
Definition at line 551 of file tpl_spanning_tree_test.cc.
References Aleph::maps().
| TYPED_TEST | ( | SpanningTreeAllGraphs | , |
| BFSNullptrThrows | |||
| ) |
Definition at line 562 of file tpl_spanning_tree_test.cc.
References Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), and Aleph::maps().
| TYPED_TEST | ( | SpanningTreeAllGraphs | , |
| BFSSingleNode | |||
| ) |
Definition at line 514 of file tpl_spanning_tree_test.cc.
References GraphCommon< GT, Node, Arc >::get_num_arcs(), GraphCommon< GT, Node, Arc >::get_num_nodes(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::maps(), and root().
| TYPED_TEST | ( | SpanningTreeAllGraphs | , |
| BFSTriangle | |||
| ) |
Definition at line 530 of file tpl_spanning_tree_test.cc.
References GraphCommon< GT, Node, Arc >::get_num_arcs(), GraphCommon< GT, Node, Arc >::get_num_nodes(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::maps(), and root().
| TYPED_TEST | ( | SpanningTreeAllGraphs | , |
| DFSEmptyGraphThrows | |||
| ) |
Definition at line 490 of file tpl_spanning_tree_test.cc.
References Aleph::maps().
| TYPED_TEST | ( | SpanningTreeAllGraphs | , |
| DFSNullptrThrows | |||
| ) |
Definition at line 501 of file tpl_spanning_tree_test.cc.
References Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), and Aleph::maps().
| TYPED_TEST | ( | SpanningTreeAllGraphs | , |
| DFSSingleNode | |||
| ) |
Definition at line 453 of file tpl_spanning_tree_test.cc.
References GraphCommon< GT, Node, Arc >::get_num_arcs(), GraphCommon< GT, Node, Arc >::get_num_nodes(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::maps(), and root().
| TYPED_TEST | ( | SpanningTreeAllGraphs | , |
| DFSTriangle | |||
| ) |
Definition at line 469 of file tpl_spanning_tree_test.cc.
References GraphCommon< GT, Node, Arc >::get_num_arcs(), GraphCommon< GT, Node, Arc >::get_num_nodes(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::maps(), and root().
| TYPED_TEST | ( | SpanningTreeUndirectedGraphs | , |
| BFSLongerChain | |||
| ) |
Definition at line 600 of file tpl_spanning_tree_test.cc.
References GraphCommon< GT, Node, Arc >::get_num_arcs(), GraphCommon< GT, Node, Arc >::get_num_nodes(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::maps(), and root().
| TYPED_TEST | ( | SpanningTreeUndirectedGraphs | , |
| DFSLongerChain | |||
| ) |
Definition at line 575 of file tpl_spanning_tree_test.cc.
References GraphCommon< GT, Node, Arc >::get_num_arcs(), GraphCommon< GT, Node, Arc >::get_num_nodes(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::maps(), and root().
| TYPED_TEST_SUITE | ( | SpanningTreeAllGraphs | , |
| GraphTypes | |||
| ) |
| TYPED_TEST_SUITE | ( | SpanningTreeUndirectedGraphs | , |
| UndirectedGraphTypes | |||
| ) |