Breaking News: Grepper is joining You.com. Read the official announcement!

Number of ways to reach at starting node after travelling through exactly K edges in a complete graph

Deepika Sahu answered on December 30, 2022 Popularity 1/10 Helpfulness 1/10

answer Number of ways to reach at starting node after travelling through exactly K edges in a complete graph

Number of ways to reach at starting node after travelling through exactly K edges in a complete graph

Comment

// Java program for the above approach
class GFG{
 
// Function to find number of ways to
// reach from node 1 to 1 again, after
// moving exactly K edges
static void numberOfWays(int n, int k)
{
     
    // Initialize a dp[] array, where dp[i]
    // stores number of ways to reach at
    // a i node
    int[] dp = new int[1000];
 
    // Initialize the dp array with 0
    for(int i = 0; i < n; i++)
    {
        dp[i] = 0;
    }
 
    // Base Case
    dp[0] = 1;
 
    // Iterate for the number of edges moved
    for(int i = 1; i <= k; i++)
    {
         
        // Sum will store number of ways to
        // reach all the nodes
        int numWays = 0;
 
        // Iterate for every possible state
        // for the current step
        for(int j = 0; j < n; j++)
        {
            numWays += dp[j];
        }
 
        // Update the value of the dp array
        // after travelling each edge
        for(int j = 0; j < n; j++)
        {
            dp[j] = numWays - dp[j];
        }
    }
 
    // Print dp[0] as the answer
    System.out.println(dp[0] + "\n");
}
 
// Driver Code
public static void main(String args[])
{
     
    // Given Input
    int N = 5, K = 3;
 
    // Function Call
    numberOfWays(N, K);
}
}
 
// This code is contributed by _saurabh_jaiswal

Popularity 1/10 Helpfulness 1/10 Language java

Source: www.geeksforgeeks.org

Tags: edges graph java k

Link to this answer
Share Copy Link

Contributed on Dec 30 2022

Deepika Sahu

0 Answers Avg Quality 2/10

Number of ways to reach at starting node after travelling through exactly K edges in a complete graph

Contents

More Related Answers

Number of ways to reach at starting node after travelling through exactly K edges in a complete graph

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.