# Kth largest node among all directly connected nodes to the given node in an undirected graph

Given two arrays **u** and **v**, representing a graph such that there is an undirected edge from **u[i]** to **v[i]** (0 ≤ v[i], u[i] < N) and each node has some value **val[i]** (0 ≤ i < N). For each node, if the nodes connected directly to it are sorted in descending order according to their values (in case of equal values, sort it according to their indices in ascending order), print the number of the node at **k ^{th}** position. If total nodes are

**< k**then print

**-1**.

**Examples:**

Input:u[] = {0, 0, 1}, v[] = {2, 1, 2}, val[] = {2, 4, 3}, k = 2

Output:

2

0

0

For 0 node, the nodes directly connected to it are 1 and 2

having values 4 and 3 respectively, thus node with 2nd largest value is 2.

For 1 node, the nodes directly connected to it are 0 and 2

having values 2 and 3 respectively, thus node with 2nd largest value is 0.

For 2 node, the nodes directly connected to it are 0 and 1

having values 2 and 4 respectively, thus node with 2nd largest value is 0.

Input:u[] = {0, 2}, v[] = {2, 1}, val[] = {2, 4, 3}, k = 2

Output:

-1

-1

0

**Approach:** The idea is to store the nodes directly connected to a node along with their values in a vector and sort them in increasing order, and the kth largest value for a node, having **n** number of nodes directly connected to it, will be **(n – k)**th node from last.

Below is the implementation of the above approach:

## C++

`// C++ implementation of the approach ` `#include <bits/stdc++.h> ` `using` `namespace` `std; ` ` ` `// Function to print Kth node for each node ` `void` `findKthNode(` `int` `u[], ` `int` `v[], ` `int` `n, ` `int` `val[], ` `int` `V, ` `int` `k) ` `{ ` ` ` ` ` `// Vector to store nodes directly ` ` ` `// connected to ith node along with ` ` ` `// their values ` ` ` `vector<pair<` `int` `, ` `int` `> > g[V]; ` ` ` ` ` `// Add edges to the vector along with ` ` ` `// the values of the node ` ` ` `for` `(` `int` `i = 0; i < n; i++) { ` ` ` `g[u[i]].push_back(make_pair(val[v[i]], v[i])); ` ` ` `g[v[i]].push_back(make_pair(val[u[i]], u[i])); ` ` ` `} ` ` ` ` ` `// Sort neighbors of every node ` ` ` `// and find the Kth node ` ` ` `for` `(` `int` `i = 0; i < V; i++) { ` ` ` `if` `(g[i].size() > 0) ` ` ` `sort(g[i].begin(), g[i].end()); ` ` ` ` ` `// Get the kth node ` ` ` `if` `(k <= g[i].size()) ` ` ` `printf` `(` `"%d\n"` `, g[i][g[i].size() - k].second); ` ` ` ` ` `// If total nodes are < k ` ` ` `else` ` ` `printf` `(` `"-1\n"` `); ` ` ` `} ` ` ` ` ` `return` `; ` `} ` ` ` `// Driver code ` `int` `main() ` `{ ` ` ` `int` `V = 3; ` ` ` `int` `val[] = { 2, 4, 3 }; ` ` ` `int` `u[] = { 0, 0, 1 }; ` ` ` `int` `v[] = { 2, 1, 2 }; ` ` ` ` ` `int` `n = ` `sizeof` `(u) / ` `sizeof` `(` `int` `); ` ` ` `int` `k = 2; ` ` ` ` ` `findKthNode(u, v, n, val, V, k); ` ` ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

## Python3

`# Python3 implementation of the approach ` ` ` `# Function to print Kth node for each node ` `def` `findKthNode(u, v, n, val, V, k): ` ` ` ` ` `# Vector to store nodes directly connected ` ` ` `# to ith node along with their values ` ` ` `g ` `=` `[[] ` `for` `i ` `in` `range` `(V)] ` ` ` ` ` `# Add edges to the vector along ` ` ` `# with the values of the node ` ` ` `for` `i ` `in` `range` `(` `0` `, n): ` ` ` `g[u[i]].append((val[v[i]], v[i])) ` ` ` `g[v[i]].append((val[u[i]], u[i])) ` ` ` ` ` `# Sort neighbors of every node ` ` ` `# and find the Kth node ` ` ` `for` `i ` `in` `range` `(` `0` `, V): ` ` ` `if` `len` `(g[i]) > ` `0` `: ` ` ` `g[i].sort() ` ` ` ` ` `# Get the kth node ` ` ` `if` `k <` `=` `len` `(g[i]): ` ` ` `print` `(g[i][` `-` `k][` `1` `]) ` ` ` ` ` `# If total nodes are < k ` ` ` `else` `: ` ` ` `print` `(` `"-1"` `) ` ` ` ` ` `return` ` ` `# Driver code ` `if` `__name__ ` `=` `=` `"__main__"` `: ` ` ` ` ` `V ` `=` `3` ` ` `val ` `=` `[` `2` `, ` `4` `, ` `3` `] ` ` ` `u ` `=` `[` `0` `, ` `0` `, ` `1` `] ` ` ` `v ` `=` `[` `2` `, ` `1` `, ` `2` `] ` ` ` `n, k ` `=` `len` `(u), ` `2` ` ` ` ` `findKthNode(u, v, n, val, V, k) ` ` ` `# This code is contributed by Rituraj Jain ` |

*chevron_right*

*filter_none*

**Output:**

2 0 0

## Recommended Posts:

- Minimum edges to be added in a directed graph so that any node can be reachable from a given node
- Connected Components in an undirected graph
- Cycles of length n in an undirected and connected graph
- Sum of the minimum elements in all connected components of an undirected graph
- Clone an undirected graph with multiple connected components
- Maximum number of edges among all connected components of an undirected graph
- Program to count Number of connected components in an undirected graph
- Minimum cost path from source node to destination node via an intermediate node
- Number of ways to select a node from each connected component
- Sum of degrees of all nodes of a undirected graph
- XOR of all the nodes in the sub-tree of the given node
- k'th heaviest adjacent node in a graph where each vertex has weight
- Swap Kth node from beginning with Kth node from end in a Linked List
- Find all reachable nodes from every node present in a given set
- Count single node isolated sub-graphs in a disconnected graph

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.