OpenSoure_Repos/TheAlgorithms-C-Plus-Plus
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git synced 2023-10-11 13:05:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

Fixed presentation error around brackets

Browse Source
This commit is contained in:
Mann Mehta 2020-04-17 23:37:29 +05:30
parent a3b2f4d17e
commit ff8a511413
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
dynamic_programming/tree_height.cpp
View File

@ -25,7 +25,7 @@ std::vector<int> dp;
void dp_with_dfs(int u) {
visited[u] = true;
int child_height = 1;
for(int v : adj[u]) {
for (int v : adj[u]) {
if (!visited[v]) {
dp_with_dfs(v);
@ -43,7 +43,7 @@ int main() {
std::cin >> n;
int u, v;
/// Tree contains exactly n-1 edges where n denotes the nodes.
for(int i=0; i < n-1; i++) {
for (int i = 0; i < n-1; i++) {
std::cin >> u >> v;
/// undirected tree u -> v and v -> u.
adj[u].push_back(v);
@ -54,7 +54,7 @@ int main() {
/// initialize depth of all nodes to 0.
dp.assign(n+1, 0);
/// function call which will initialize the height of all nodes.
dp_with_dfs (1);
dp_with_dfs(1);
std::cout << "Height of the Tree : " << dp[1] << std::endl;
}