ah_graph_concepts_test.cc File Reference

#include <ah-graph-concepts.H>
#include <gtest/gtest.h>
#include <Dijkstra.H>
#include <Johnson.H>
#include <K_Shortest_Paths.H>
#include <io_graph.H>
#include <Kruskal.H>
#include <tpl_agraph.H>
#include <tpl_graph.H>
#include <tpl_indexGraph.H>
#include <tpl_maxflow.H>
#include <tpl_net.H>
#include <tpl_sgraph.H>

Include dependency graph for ah_graph_concepts_test.cc:

Go to the source code of this file.

Concepts
concept	can_dijkstra
concept	can_dijkstra_with
concept	can_kruskal_with
concept	can_max_flow
concept	can_yen
concept	can_copy_graph
concept	can_clear_graph
concept	can_compare_graphs
concept	can_for_each_node
concept	can_filter_arcs_with
concept	can_out_nodes
concept	can_io_graph
concept	can_io_graph_with_node_filter

Functions
	TEST (AhGraphConceptsTest, InOutArcHelpersCompileAndAgree)
	TEST (AhGraphConceptsTest, ConstrainedAlgorithmsStillRun)

Function Documentation

TEST() [1/2]

TEST	(	AhGraphConceptsTest	,
		ConstrainedAlgorithmsStillRun
	)

Definition at line 159 of file ah_graph_concepts_test.cc.

References Aleph::blossom_maximum_cardinality_matching().

TEST() [2/2]

TEST	(	AhGraphConceptsTest	,
		InOutArcHelpersCompileAndAgree
	)

Definition at line 134 of file ah_graph_concepts_test.cc.

References Aleph::blossom_maximum_cardinality_matching(), and Aleph::size().