-
Notifications
You must be signed in to change notification settings - Fork 4
/
BFSVisitor.cpp
39 lines (37 loc) · 1.42 KB
/
BFSVisitor.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
//=======================================================================
// Copyright 2015 - 2020 Jeff Linahan
//
// Distributed under the Boost Software License, Version 1.0. (See
// accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//=======================================================================
#include "BFSVisitor.h"
using namespace std;
vector<vertex_t> ancestors(vertex_t v) const
{
//cout << "first v: " << v << '\n';
//cout << "root: " << vis.root << '\n';
vector<vertex_t> ans = {v};
while( v != data.root ){
auto v_it = data.verts.find(v);
if( v_it == data.verts.end() ) return ans; // root is in a different connected component
v = v_it->second.parent;
//cout << "pushing back v: " << v << '\n';
ans.push_back(v);
}
return ans;
}
vector<vertex_t> BFSVisitor::ancestors(vertex_t v) const
{
//cout << "first v: " << v << '\n';
//cout << "root: " << data.root << '\n';
vector<vertex_t> ans = {v};
while( v != data.root ){
auto v_it = data.verts.find(v);
if( v_it == data.verts.end() ) return ans; // root is in a different connected component
v = v_it->second.parent;
//cout << "pushing back v: " << v << '\n';
ans.push_back(v);
}
return ans;
}