boost/graph
2
0
Fork 0
mirror of https://github.com/boostorg/graph.git synced 2026-01-31 08:12:14 +00:00
Code Issues Projects Releases Wiki Activity

fixed some bugs in remove_in_edge_if(), yeah concept checks!

Browse Source 
[SVN r8290]
This commit is contained in:
Jeremy Siek
2000-11-22 05:51:04 +00:00
parent 6dad6aadbf
commit 120fa133ed
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
include/boost/graph/detail/adjacency_list.hpp
View File

@@ -736,9 +736,9 @@ namespace boost {
template <class Config, class Predicate>
void
remove_in_edge_if(typename Config::vertex_descriptor u, Predicate pred,
undirected_graph_helper<Config>& g_)
undirected_graph_helper<Config>& g_)
{
remove_out_edge_if(u, pref, g_);
remove_out_edge_if(u, pred, g_);
}
// O(E/V * E) or O(log(E/V) * E)
@@ -957,7 +957,7 @@ namespace boost {
if (pred(*in_i)) {
typename Config::vertex_descriptor u = source(*in_i, g);
detail::remove_directed_edge_dispatch
(*in_i, g.out_edge_list(u), (PropT&)(*in_i).get_property());
(*in_i, g.out_edge_list(u), *(PropT*)(*in_i).get_property());
g.m_edges.erase( (*in_i.iter()).get_iter() );
}
// Now remove the edges from this in-edge list.