|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Tests for Graph Traverse. More...
#include <gtest/gtest.h>#include <vector>#include <set>#include <graph-traverse.H>#include <tpl_graph.H>Go to the source code of this file.
Classes | |
| class | GraphTraverseTest |
| class | DisconnectedGraphTest |
| class | TreeGraphTest |
| Tree graph for graph_to_tree conversion testing. More... | |
| class | CyclicGraphTest |
| class | DigraphTraverseTest |
| struct | EvenArcFilter< GT > |
Typedefs | |
| using | TestGraph = List_Graph< Graph_Node< int >, Graph_Arc< double > > |
| using | TestDigraph = List_Digraph< Graph_Node< int >, Graph_Arc< double > > |
Functions | |
| TEST_F (GraphTraverseTest, DFSVisitsAllNodes) | |
| TEST_F (GraphTraverseTest, DFSStartsFromCorrectNode) | |
| TEST_F (GraphTraverseTest, DFSEarlyTermination) | |
| TEST_F (GraphTraverseTest, BFSVisitsAllNodes) | |
| TEST_F (TreeGraphTest, BFSVisitsInLevelOrder) | |
| TEST_F (GraphTraverseTest, BFSEarlyTermination) | |
| TEST_F (DisconnectedGraphTest, TraversalStopsAtComponentBoundary) | |
| TEST_F (DisconnectedGraphTest, CanTraverseSecondComponent) | |
| TEST_F (CyclicGraphTest, DFSHandlesCycle) | |
| TEST_F (CyclicGraphTest, BFSHandlesCycle) | |
| TEST_F (GraphTraverseTest, ExecProvidesArcInformation) | |
| TEST_F (GraphTraverseTest, ExecEarlyTermination) | |
| TEST_F (GraphTraverseTest, DualOpVisitsNodesAndArcs) | |
| TEST_F (GraphTraverseTest, DualOpNodeEarlyTermination) | |
| TEST_F (GraphTraverseTest, DualOpArcEarlyTermination) | |
| TEST_F (DigraphTraverseTest, DFSOnDigraph) | |
| TEST_F (DigraphTraverseTest, BFSOnDigraph) | |
| TEST (SingleNodeTest, DFSSingleNode) | |
| TEST (SingleNodeTest, BFSSingleNode) | |
| TEST_F (GraphTraverseTest, DFSWithArcFilter) | |
| TEST (LinearChainTest, DFSLinearChain) | |
| TEST (LinearChainTest, BFSLinearChain) | |
| TEST (CompleteGraphTest, DFSCompleteGraph) | |
| TEST (StressTest, LargeGraphDFS) | |
| TEST (StressTest, LargeGraphBFS) | |
| int | main (int argc, char **argv) |
Tests for Graph Traverse.
Definition in file graph_traverse_test.cc.
| using TestDigraph = List_Digraph<Graph_Node<int>, Graph_Arc<double> > |
Definition at line 48 of file graph_traverse_test.cc.
| using TestGraph = List_Graph<Graph_Node<int>, Graph_Arc<double> > |
Definition at line 47 of file graph_traverse_test.cc.
| int main | ( | int | argc, |
| char ** | argv | ||
| ) |
Definition at line 775 of file graph_traverse_test.cc.
References Aleph::maps().
| TEST | ( | CompleteGraphTest | , |
| DFSCompleteGraph | |||
| ) |
Definition at line 681 of file graph_traverse_test.cc.
References Aleph::count(), Aleph::DynList< T >::insert(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::maps(), nodes, and Aleph::HTList::size().
| TEST | ( | LinearChainTest | , |
| BFSLinearChain | |||
| ) |
Definition at line 649 of file graph_traverse_test.cc.
References Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::maps(), nodes, and Aleph::HTList::size().
| TEST | ( | LinearChainTest | , |
| DFSLinearChain | |||
| ) |
Definition at line 622 of file graph_traverse_test.cc.
References Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::maps(), nodes, and Aleph::HTList::size().
| TEST | ( | SingleNodeTest | , |
| BFSSingleNode | |||
| ) |
Definition at line 563 of file graph_traverse_test.cc.
References Aleph::count(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), and Aleph::maps().
| TEST | ( | SingleNodeTest | , |
| DFSSingleNode | |||
| ) |
Definition at line 543 of file graph_traverse_test.cc.
References Aleph::count(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), and Aleph::maps().
| TEST | ( | StressTest | , |
| LargeGraphBFS | |||
| ) |
Definition at line 742 of file graph_traverse_test.cc.
References Aleph::count(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::maps(), N, and nodes.
| TEST | ( | StressTest | , |
| LargeGraphDFS | |||
| ) |
Definition at line 713 of file graph_traverse_test.cc.
References Aleph::count(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::maps(), N, and nodes.
| TEST_F | ( | CyclicGraphTest | , |
| BFSHandlesCycle | |||
| ) |
Definition at line 360 of file graph_traverse_test.cc.
References Aleph::count(), Aleph::DynList< T >::insert(), Aleph::maps(), nodes, and Aleph::HTList::size().
| TEST_F | ( | CyclicGraphTest | , |
| DFSHandlesCycle | |||
| ) |
Definition at line 342 of file graph_traverse_test.cc.
References Aleph::count(), Aleph::DynList< T >::insert(), Aleph::maps(), nodes, and Aleph::HTList::size().
| TEST_F | ( | DigraphTraverseTest | , |
| BFSOnDigraph | |||
| ) |
Definition at line 521 of file graph_traverse_test.cc.
References Aleph::maps(), nodes, and Aleph::HTList::size().
| TEST_F | ( | DigraphTraverseTest | , |
| DFSOnDigraph | |||
| ) |
Definition at line 502 of file graph_traverse_test.cc.
References Aleph::count(), Aleph::DynList< T >::insert(), Aleph::maps(), nodes, and Aleph::HTList::size().
| TEST_F | ( | DisconnectedGraphTest | , |
| CanTraverseSecondComponent | |||
| ) |
Definition at line 319 of file graph_traverse_test.cc.
References Aleph::count(), Aleph::DynList< T >::insert(), Aleph::maps(), and nodes.
| TEST_F | ( | DisconnectedGraphTest | , |
| TraversalStopsAtComponentBoundary | |||
| ) |
Definition at line 297 of file graph_traverse_test.cc.
References Aleph::count(), Aleph::DynList< T >::insert(), Aleph::maps(), and nodes.
| TEST_F | ( | GraphTraverseTest | , |
| BFSEarlyTermination | |||
| ) |
Definition at line 277 of file graph_traverse_test.cc.
References Aleph::count(), Aleph::maps(), and nodes.
| TEST_F | ( | GraphTraverseTest | , |
| BFSVisitsAllNodes | |||
| ) |
Definition at line 231 of file graph_traverse_test.cc.
References Aleph::count(), Aleph::DynList< T >::insert(), Aleph::maps(), nodes, and Aleph::HTList::size().
| TEST_F | ( | GraphTraverseTest | , |
| DFSEarlyTermination | |||
| ) |
Definition at line 210 of file graph_traverse_test.cc.
References Aleph::count(), Aleph::maps(), and nodes.
| TEST_F | ( | GraphTraverseTest | , |
| DFSStartsFromCorrectNode | |||
| ) |
Definition at line 193 of file graph_traverse_test.cc.
References Aleph::maps(), and nodes.
| TEST_F | ( | GraphTraverseTest | , |
| DFSVisitsAllNodes | |||
| ) |
Definition at line 174 of file graph_traverse_test.cc.
References Aleph::count(), Aleph::DynList< T >::insert(), Aleph::maps(), nodes, and Aleph::HTList::size().
| TEST_F | ( | GraphTraverseTest | , |
| DFSWithArcFilter | |||
| ) |
Definition at line 596 of file graph_traverse_test.cc.
References Aleph::count(), Aleph::DynList< T >::insert(), Aleph::maps(), and nodes.
| TEST_F | ( | GraphTraverseTest | , |
| DualOpArcEarlyTermination | |||
| ) |
Definition at line 475 of file graph_traverse_test.cc.
References Aleph::maps(), and nodes.
| TEST_F | ( | GraphTraverseTest | , |
| DualOpNodeEarlyTermination | |||
| ) |
Definition at line 452 of file graph_traverse_test.cc.
References Aleph::maps(), and nodes.
| TEST_F | ( | GraphTraverseTest | , |
| DualOpVisitsNodesAndArcs | |||
| ) |
Definition at line 425 of file graph_traverse_test.cc.
References Aleph::DynList< T >::insert(), Aleph::maps(), nodes, and Aleph::HTList::size().
| TEST_F | ( | GraphTraverseTest | , |
| ExecEarlyTermination | |||
| ) |
Definition at line 405 of file graph_traverse_test.cc.
References Aleph::count(), Graph_Traverse< GT, Itor, Q, Show_Arc >::exec(), Aleph::maps(), and nodes.
| TEST_F | ( | GraphTraverseTest | , |
| ExecProvidesArcInformation | |||
| ) |
Definition at line 381 of file graph_traverse_test.cc.
References Aleph::count(), Graph_Traverse< GT, Itor, Q, Show_Arc >::exec(), GTNodeCommon< NodeInfo >::get_info(), Aleph::maps(), nodes, and Aleph::HTList::size().
| TEST_F | ( | TreeGraphTest | , |
| BFSVisitsInLevelOrder | |||
| ) |
Definition at line 248 of file graph_traverse_test.cc.
References Aleph::maps(), and nodes.