backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-02-08 04:59:21 +08:00
Code Issues Projects Releases Wiki Activity

Remove a useless and possibly bad Graph constuctor overload

Browse Source
This commit is contained in:
Anmol3299
2020-06-03 20:33:38 +05:30
parent a77dafba64
commit 8f04ffe3fb
1 changed files with 0 additions and 20 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
graph/cycle_check_directed_graph.cpp
View File

@@ -98,26 +98,6 @@ class Graph {
}
}
/** Create a graph from vertices and a set of edges.
*
* Adjacency list of the graph would be created from the set of edges. If
* the source or destination of any edge has a value greater or equal to
* number of vertices, then it would throw a range_error.
*
* @param vertices specify the number of vertices the graph would contain.
* @param edges is a vector of edges.
*/
Graph(unsigned int vertices, std::vector<Edge>&& edges)
: m_vertices(vertices) {
for (auto&& edge : edges) {
if (edge.src >= vertices || edge.dest >= vertices) {
throw std::range_error(
"Either src or dest of edge out of range");
}
m_adjList[edge.src].emplace_back(std::move(edge.dest));
}
}
/** Return a const reference of the adjacency list.
*
* @return const reference to the adjacency list