graphicness.hpp File Reference

#include <boost/graph/bipartite.hpp>
#include <boost/graph/detail/set_adaptor.hpp>
#include <boost/graph/filtered_graph.hpp>
#include <boost/graph/connected_components.hpp>
#include <boost/graph/biconnected_components.hpp>
#include <boost/property_map/property_map.hpp>
#include <vector>
#include "matroid_graph.hpp"
#include "graph_utils.hpp"
#include <boost/graph/adjacency_list_io.hpp>

Go to the source code of this file.

Classes
struct	tu::articulation_edge_filter< Graph >

Namespaces
	tu

Functions
template<typename MatroidType , typename MatrixType >
int	tu::find_parallel_to_row (const MatroidType &matroid, const MatrixType &matrix, const size_t minor_height, const size_t minor_width, const size_t row)
template<typename Graph , typename Vertex , typename EdgeSet >
struct articulation_edge_filter< Graph >	tu::make_articulation_edge_filter (const Graph *graph, const Vertex *articulation_vertex, const EdgeSet *evil_edges)
template<typename MatroidType , typename MatrixType >
bool	tu::extend_graph (matroid_graph &graph, const MatroidType &matroid, const MatrixType &matrix, const size_t minor_height, const size_t minor_width, const nested_minor_sequence::extension_type extension_type)
template<typename MatroidType , typename MatrixType , typename NestedMinorSequenceType >
matroid_graph *	tu::construct_matroid_graph (const MatroidType &matroid, const MatrixType &matrix, const NestedMinorSequenceType &nested_minors, size_t &largest_graphic_minor)