Code in C programming only (not C++ or Java or Pytho BeautifulPath You are supposed to write production ready code with Proper Unit Test Cases, Modularizaton etc. You need to write your test cases under user package in test folder. One sample test is created u package for reference. Your code will be evaluated on the basis of code coverage, Code Quality, Best Practices and Bugs. NOTE: Here, we use CMocka for writing test cases and GCC Compiler. **PROBLEM:** Given a directed graph with N nodes and M edges. Each node is associated with lowercase english Beauty of a path is defined as the number of most frequently occurring alphabet. Find the most beautiful path and return the maximum beauty value it has. **CONSTRAINTS:** 1

Programming Logic & Design Comprehensive
9th Edition
ISBN:9781337669405
Author:FARRELL
Publisher:FARRELL
Chapter2: Elements Of High-quality Programs
Section: Chapter Questions
Problem 9RQ
icon
Related questions
Question

 

 

 

Code in C programming only (not C++ or Java or Python)
You are supposed to write production ready code with Proper Unit Test Cases, Modularizaton etc.
You need to write your test cases under user package in test folder. One sample test i created under same
package for reference.
BeautifulPath
Your code will be evaluated on the basis of code coverage, Code Quality, Best Practices and Bugs.
NOTE: Here, we use CMocka for writing test cases and GCC Compiler.
**PROBLEM:**
Given a directed graph with N nodes and M edges. Each node is associated with lowercase english alphabet.
Beauty of a path is defined as the number of most frequently occurring alphabet.
Find the most beautiful path and return the maximum beauty value it has.
**CONSTRAINTS:**
1<N,M< 300000
**FUNCTION DESCRIPTION:**
Complete the function beauty in code. Function must Return an integer, the beauty of most beautiful path.
If the value is very large return -1.
Function beauty has the following parameter(s):
n: integer, number of nodes
m: integer, number of directed edges
S: string of length n where ith alphabet denotes the alphabets associated with ith node
X: list of length m
Y: list of length m
X, Y: two integers arrays of length M, pair Xi, Yi denotes there is an edge from node Xi to Yi.
Output
Return an integer, the beauty of most beautiful path. If the value is very large return -1.
**EXAMPLE:**
Input:-
n: 5
m: 4
s: abaca
x: [1, 1, 3, 4]
y: [2, 3, 4, 5]
Output:- 3
Explanation- Path with maximum beauty is (1->3->4->5) ie (aaca)
loout
Strictly Use the following Function :-
int beauty(int v, int e, String s, int[] x, int[] y)
Transcribed Image Text:Code in C programming only (not C++ or Java or Python) You are supposed to write production ready code with Proper Unit Test Cases, Modularizaton etc. You need to write your test cases under user package in test folder. One sample test i created under same package for reference. BeautifulPath Your code will be evaluated on the basis of code coverage, Code Quality, Best Practices and Bugs. NOTE: Here, we use CMocka for writing test cases and GCC Compiler. **PROBLEM:** Given a directed graph with N nodes and M edges. Each node is associated with lowercase english alphabet. Beauty of a path is defined as the number of most frequently occurring alphabet. Find the most beautiful path and return the maximum beauty value it has. **CONSTRAINTS:** 1<N,M< 300000 **FUNCTION DESCRIPTION:** Complete the function beauty in code. Function must Return an integer, the beauty of most beautiful path. If the value is very large return -1. Function beauty has the following parameter(s): n: integer, number of nodes m: integer, number of directed edges S: string of length n where ith alphabet denotes the alphabets associated with ith node X: list of length m Y: list of length m X, Y: two integers arrays of length M, pair Xi, Yi denotes there is an edge from node Xi to Yi. Output Return an integer, the beauty of most beautiful path. If the value is very large return -1. **EXAMPLE:** Input:- n: 5 m: 4 s: abaca x: [1, 1, 3, 4] y: [2, 3, 4, 5] Output:- 3 Explanation- Path with maximum beauty is (1->3->4->5) ie (aaca) loout Strictly Use the following Function :- int beauty(int v, int e, String s, int[] x, int[] y)
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
ADT and Class
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Programming Logic & Design Comprehensive
Programming Logic & Design Comprehensive
Computer Science
ISBN:
9781337669405
Author:
FARRELL
Publisher:
Cengage
Np Ms Office 365/Excel 2016 I Ntermed
Np Ms Office 365/Excel 2016 I Ntermed
Computer Science
ISBN:
9781337508841
Author:
Carey
Publisher:
Cengage