Prime Path Finder

Prime Path Finder in C

Description

This is an implementation of Prime Path Finder algorithm based on the Alg. 1 in [2]. The authors of paper proposed a prime path finder that is a extention of prime path procedure in [1] (see chapter 2, subsection 2.2.1, paeg 36).

Concerns

The main concenrs, when the graph has many arcs and edges, is Memory.

Data

For input, we use the graph format (.gr) that introduced in DIMACS.

Implementation

For implementation, we make use of Linked List as our basic data structure.

Example

As an exampple, we created the follwong graph in the sample.gr and ran it.

The follwoing figure, show the result of prime pathes in the example (there are 10 prime pathes):

Compile and Run

First you must compile the source code by gcc primePathFinder.c -o prime, then you can run it by ./prime.

Reference

1. Ammann, Paul, and Jeff Offutt. Introduction to software testing. Cambridge University Press, 2016.
2. Dwarakanath, Anurag, and Aruna Jankiti. "Minimum number of test paths for prime path and other structural coverage criteria." IFIP International Conference on Testing Software and Systems. Springer, Berlin, Heidelberg, 2014.