#include <algorithm>
#include <vector>
#include <stack>
#include <boost/make_shared.hpp>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/filtered_graph.hpp>
#include <boost/graph/graph_utility.hpp>
#include <boost/graph/iteration_macros.hpp>
#include <boost/graph/properties.hpp>
#include <boost/property_map/shared_array_property_map.hpp>
Namespaces | |
boost | |
Duration formatting facet for input. | |
boost::detail | |
Functions | |
template<typename PropertyMapFirst , typename PropertyMapSecond > | |
property_map_equivalent < PropertyMapFirst, PropertyMapSecond > | boost::make_property_map_equivalent (const PropertyMapFirst property_map1, const PropertyMapSecond property_map2) |
template<typename GraphFirst , typename GraphSecond , typename CorrespondenceMapFirstToSecond , typename CorrespondenceMapSecondToFirst , typename EdgeEquivalencePredicate , typename VertexEquivalencePredicate > | |
bool | boost::detail::can_extend_graph (const GraphFirst &graph1, const GraphSecond &graph2, CorrespondenceMapFirstToSecond correspondence_map_1_to_2, CorrespondenceMapSecondToFirst, typename graph_traits< GraphFirst >::vertices_size_type subgraph_size, typename graph_traits< GraphFirst >::vertex_descriptor new_vertex1, typename graph_traits< GraphSecond >::vertex_descriptor new_vertex2, EdgeEquivalencePredicate edges_equivalent, VertexEquivalencePredicate vertices_equivalent, bool only_connected_subgraphs) |
template<typename GraphFirst , typename GraphSecond , typename VertexIndexMapFirst , typename VertexIndexMapSecond , typename CorrespondenceMapFirstToSecond , typename CorrespondenceMapSecondToFirst , typename VertexStackFirst , typename EdgeEquivalencePredicate , typename VertexEquivalencePredicate , typename SubGraphInternalCallback > | |
bool | boost::detail::mcgregor_common_subgraphs_internal (const GraphFirst &graph1, const GraphSecond &graph2, const VertexIndexMapFirst &vindex_map1, const VertexIndexMapSecond &vindex_map2, CorrespondenceMapFirstToSecond correspondence_map_1_to_2, CorrespondenceMapSecondToFirst correspondence_map_2_to_1, VertexStackFirst &vertex_stack1, EdgeEquivalencePredicate edges_equivalent, VertexEquivalencePredicate vertices_equivalent, bool only_connected_subgraphs, SubGraphInternalCallback subgraph_callback) |
template<typename GraphFirst , typename GraphSecond , typename VertexIndexMapFirst , typename VertexIndexMapSecond , typename EdgeEquivalencePredicate , typename VertexEquivalencePredicate , typename SubGraphInternalCallback > | |
void | boost::detail::mcgregor_common_subgraphs_internal_init (const GraphFirst &graph1, const GraphSecond &graph2, const VertexIndexMapFirst vindex_map1, const VertexIndexMapSecond vindex_map2, EdgeEquivalencePredicate edges_equivalent, VertexEquivalencePredicate vertices_equivalent, bool only_connected_subgraphs, SubGraphInternalCallback subgraph_callback) |
template<typename GraphFirst , typename GraphSecond , typename VertexIndexMapFirst , typename VertexIndexMapSecond , typename EdgeEquivalencePredicate , typename VertexEquivalencePredicate , typename SubGraphCallback > | |
void | boost::mcgregor_common_subgraphs (const GraphFirst &graph1, const GraphSecond &graph2, const VertexIndexMapFirst vindex_map1, const VertexIndexMapSecond vindex_map2, EdgeEquivalencePredicate edges_equivalent, VertexEquivalencePredicate vertices_equivalent, bool only_connected_subgraphs, SubGraphCallback user_callback) |
template<typename GraphFirst , typename GraphSecond , typename SubGraphCallback > | |
void | boost::mcgregor_common_subgraphs (const GraphFirst &graph1, const GraphSecond &graph2, bool only_connected_subgraphs, SubGraphCallback user_callback) |
template<typename GraphFirst , typename GraphSecond , typename SubGraphCallback , typename Param , typename Tag , typename Rest > | |
void | boost::mcgregor_common_subgraphs (const GraphFirst &graph1, const GraphSecond &graph2, bool only_connected_subgraphs, SubGraphCallback user_callback, const bgl_named_params< Param, Tag, Rest > ¶ms) |
template<typename GraphFirst , typename GraphSecond , typename VertexIndexMapFirst , typename VertexIndexMapSecond , typename EdgeEquivalencePredicate , typename VertexEquivalencePredicate , typename SubGraphCallback > | |
void | boost::mcgregor_common_subgraphs_unique (const GraphFirst &graph1, const GraphSecond &graph2, const VertexIndexMapFirst vindex_map1, const VertexIndexMapSecond vindex_map2, EdgeEquivalencePredicate edges_equivalent, VertexEquivalencePredicate vertices_equivalent, bool only_connected_subgraphs, SubGraphCallback user_callback) |
template<typename GraphFirst , typename GraphSecond , typename SubGraphCallback > | |
void | boost::mcgregor_common_subgraphs_unique (const GraphFirst &graph1, const GraphSecond &graph2, bool only_connected_subgraphs, SubGraphCallback user_callback) |
template<typename GraphFirst , typename GraphSecond , typename SubGraphCallback , typename Param , typename Tag , typename Rest > | |
void | boost::mcgregor_common_subgraphs_unique (const GraphFirst &graph1, const GraphSecond &graph2, bool only_connected_subgraphs, SubGraphCallback user_callback, const bgl_named_params< Param, Tag, Rest > ¶ms) |
template<typename GraphFirst , typename GraphSecond , typename VertexIndexMapFirst , typename VertexIndexMapSecond , typename EdgeEquivalencePredicate , typename VertexEquivalencePredicate , typename SubGraphCallback > | |
void | boost::mcgregor_common_subgraphs_maximum (const GraphFirst &graph1, const GraphSecond &graph2, const VertexIndexMapFirst vindex_map1, const VertexIndexMapSecond vindex_map2, EdgeEquivalencePredicate edges_equivalent, VertexEquivalencePredicate vertices_equivalent, bool only_connected_subgraphs, SubGraphCallback user_callback) |
template<typename GraphFirst , typename GraphSecond , typename SubGraphCallback > | |
void | boost::mcgregor_common_subgraphs_maximum (const GraphFirst &graph1, const GraphSecond &graph2, bool only_connected_subgraphs, SubGraphCallback user_callback) |
template<typename GraphFirst , typename GraphSecond , typename SubGraphCallback , typename Param , typename Tag , typename Rest > | |
void | boost::mcgregor_common_subgraphs_maximum (const GraphFirst &graph1, const GraphSecond &graph2, bool only_connected_subgraphs, SubGraphCallback user_callback, const bgl_named_params< Param, Tag, Rest > ¶ms) |
template<typename GraphFirst , typename GraphSecond , typename VertexIndexMapFirst , typename VertexIndexMapSecond , typename EdgeEquivalencePredicate , typename VertexEquivalencePredicate , typename SubGraphCallback > | |
void | boost::mcgregor_common_subgraphs_maximum_unique (const GraphFirst &graph1, const GraphSecond &graph2, const VertexIndexMapFirst vindex_map1, const VertexIndexMapSecond vindex_map2, EdgeEquivalencePredicate edges_equivalent, VertexEquivalencePredicate vertices_equivalent, bool only_connected_subgraphs, SubGraphCallback user_callback) |
template<typename GraphFirst , typename GraphSecond , typename SubGraphCallback > | |
void | boost::mcgregor_common_subgraphs_maximum_unique (const GraphFirst &graph1, const GraphSecond &graph2, bool only_connected_subgraphs, SubGraphCallback user_callback) |
template<typename GraphFirst , typename GraphSecond , typename SubGraphCallback , typename Param , typename Tag , typename Rest > | |
void | boost::mcgregor_common_subgraphs_maximum_unique (const GraphFirst &graph1, const GraphSecond &graph2, bool only_connected_subgraphs, SubGraphCallback user_callback, const bgl_named_params< Param, Tag, Rest > ¶ms) |
template<typename GraphSecond , typename GraphFirst , typename CorrespondenceMapFirstToSecond , typename MembershipMapFirst > | |
void | boost::fill_membership_map (const GraphFirst &graph1, const CorrespondenceMapFirstToSecond correspondence_map_1_to_2, MembershipMapFirst membership_map1) |
template<typename Graph , typename MembershipMap > | |
membership_filtered_graph_traits < Graph, MembershipMap > ::graph_type | boost::make_membership_filtered_graph (const Graph &graph, MembershipMap &membership_map) |