max/edmonds-matching-algorithm
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

remove unneeded method

Browse source
This commit is contained in:
Maximilian Keßler 2023-11-05 21:25:10 +01:00
parent 4fee5333a2
commit 03f9afa67b
Signed by: max
GPG key ID: BCC5A619923C0BA5
1 changed files with 0 additions and 13 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

13
src/edmonds.cpp
View file

@ -83,19 +83,6 @@ std::vector<NodeId> path_to_forest_root(Graph const & graph, NodeId id)
return retval; return retval;
} }
__attribute__((noinline))
NodeId find_outer_vertex(Graph const & graph)
{
for(NodeId id = 0; id < graph.num_nodes(); ++id)
{
if (not graph.node(id).scanned and graph.is_outer(id))
{
return id;
}
}
return invalid_node_id;
}
void collect_exposed_vertices(Graph & graph, std::stack<NodeId> & container) void collect_exposed_vertices(Graph & graph, std::stack<NodeId> & container)
{ {
std::stack<NodeId>().swap(container); std::stack<NodeId>().swap(container);