Skip to content

A path-based testing tool for efficiently computing prime paths and edge pairs in directed graphs.

License

Notifications You must be signed in to change notification settings

zerofyy/Graph-Coverage

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

9 Commits
 
 
 
 
 
 
 
 

Repository files navigation

Zerofy's Graph Coverage Tool

A free online tool for computing graph coverage in graph-based software testing.


Usage

The tool is available as a GitHub Page here with instructions on the site.

Alternatively, the algorithms can be found in this script and can be used like so:

from graph_coverage import parse_graph, compute_prime_paths, compute_edge_pairs, format_output


# Read input from file
with open('graph_input.txt', 'r') as file:
    graph = parse_graph(file.read())

# Read input from terminal
graph = parse_graph(input())

# Compute prime paths
paths = compute_prime_paths(graph)

# Compute edge pairs
pairs = compute_edge_pairs(graph)

# Print paths or pairs formatted into a Num,Len,Path table.
print(format_output(paths))
print(format_output(pairs))

# Print raw paths or pairs, as lists of nodes.
for path in paths:
    print(path)
    
for pair in pairs:
    print(pair)

TODO

  • Implement tests generation.

About

A path-based testing tool for efficiently computing prime paths and edge pairs in directed graphs.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published