DETERMINATION OF MOST FEASIBLE PATH FOR TEST DATA GENERATION USING GRAPH FUNCTIONS Abhay Kumar Tripathi, * Sandeep Srivastava Department of Computer Science & Engineering, Sobhasaria Engineering College, Sikar, Rajasthan, India Fuzzy graphs focus the complex structure of software modules. A software module corresponds to a single function or subprogram in specific languages, has a single incoming and outgoing point, and is able to be used as a design component via a reference mechanism. This document uses in C as the language for examples, and in C a module is a function. Each flow graph consists of nodes, [3] edges and vertex. The nodes represent computational statements or expressions using CFG (Context Free Grammars), and the edges represent transfer of control between nodes and [11, 12] vertexes using Zadeh theory. However, Fuzzy graph create two applications one is for graphical application (leaf application) and second one is for console application (nodes and edges application). The leaf application is also used here for graphical user interface. Here, we first generate the simple control flow graph by identifying different tokens of program and calculating the closed region in control flow graph which is useful for calculating Cyclomatic complexity of code. Then, we find out the independent paths in our program using adjacency matrix. It is the end of the first module of our project, in second module we generate the weighted control flow graph by assigning the weight on to the edges of simple control flow graph by using different methods. Using this weighted control flow graph we generate the most feasible path from source node to destination node. So our project does four tasks based upon the input program which are (1) Construct Control flow graph of the input program (2)Compute the Cyclomatic Complexity for finding independent path of program using graph matrix of CFG (3) Create Weighted Control Flow graph by using three different methods (4)Determine most feasible path using Weighted Control Flow graph. The paper uses the advance feature of library for generating window and printing date of the Systems. By working through task that creates, develop & display this C compliant application, we will be familiar with library function graphics and console application. SPECIFICATION This software tool will take as its input, a program or code in C language draw CFG, calculate Cyclomatic Complexity and no. of independent paths, find out most feasible path of the program on the basis of frequency of nodes in the CFG. The data structure used here is a weighted control flow graph. *Address for correspondence : Dr. Sandeep Srivastava, Assistant Professor, Department of Computer Science & Engineering , Sobhasaria Engineering College, Sikar, Rajasthan, India, Email : sandeep223117@gmail.com ABSTRACT Fuzzy complexity is the branch of software metrics that is focused on direct measurement of software attributes i.e. memory consumption and time execution, as opposed to indirect software measures such as project milestone status and reported system failures. For design of software tools that will determine the most feasible path for all programs in various language. To determine the most feasible path requires a construction of weighted control flow graph, which helps in determining the frequency of all paths in control flow graph and fuzzy logic. Finally most frequent path is termed as most feasible path. The key object of this paper to provide concept of most feasible path which makes the test data generation easy and acts as an effective tool for efficient testing of entire software. Keywords: Test Data Genration; Fuzzy Complexity; Edge Weight; Software Frequency INTRODUCTION 66 International Journal of Scientific and Innovative Research 2017; 5(1) : 66‐73 P‐ISSN 2347‐2189, E‐ ISSN 2347‐4971 www.ijsir.co.in