.push_back(make_pair(fromVertex, toVertex));
46ostream <<
"Edges: "<< endl;
48ostream << iter->first <<
" --> "<< iter->second << endl;
53 for(
size_t i= 0;
i< path.size(); ++
i) {
59 size_tprev_edge = path[
i- 1];
60 if(prev_edge >=
m_Edges.size() ||
62ostream <<
" | "<<
m_Edges[
i].first;
68ostream <<
" --> "<<
m_Edges[
i].second;
78 DFS(
constvector<CConvGraph::TEdge>& edges,
81vector<CConvGraph::TPath>& paths);
89 constvector<CConvGraph::TEdge>&
m_Edges;
100{
returnp1.size() < p2.size(); }
104vector<TPath>& paths)
const 106 DFS(
m_Edges, startVertex, endVertex, paths);
113vector<CConvGraph::TPath>& paths) :
114m_Edges(edges), m_Paths(paths), m_EndVertex(endVertex)
120 if(startVertex >=
size|| endVertex >=
size|| startVertex == endVertex)
void Dump(ostream &ostream) const
void DumpPath(const TPath &path, ostream &ostream) const
void FindPaths(size_t startVertex, size_t endVertex, vector< TPath > &paths) const
size_t add_edge(size_t from, size_t to)
const vector< CConvGraph::TEdge > & m_Edges
void process_vertex(size_t vertex)
vector< CConvGraph::TPath > & m_Paths
vector< TTypeAjacentList > m_AjacentVertices
vector< size_t > TTypeAjacentList
DFS(const vector< CConvGraph::TEdge > &edges, size_t startVertex, size_t endVertex, vector< CConvGraph::TPath > &paths)
CConvGraph::TPath m_Queue
static bool PCompare(const CConvGraph::TPath &p1, const CConvGraph::TPath &p2)
#define ITERATE(Type, Var, Cont)
ITERATE macro to sequence through container elements.
#define END_NCBI_SCOPE
End previously defined NCBI scope.
#define BEGIN_NCBI_SCOPE
Define ncbi namespace.
constexpr auto sort(_Init &&init)
const struct ncbi::grid::netcache::search::fields::SIZE size
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4