739
0%

Ran 11 Dec 2015 10:10PM UTC

Jobs 1

Files 27

Run time 1s

Badge

Embed ▾

pending completion

Build # 739

Build Type

push

travis-ci

Committed by

rakhimov

Commit Message

Add a script to generate a fault tree of N Queens

This is a fault tree representation of the N Queens problem.
The problem can serve as a benchmark for BDD implementation.
MOCUS and ZBDD also solve the default (8 Queens) problem
in a short time as BDD (< 0.2s).

The major surprise came from the Preprocessor.
It takes from 0.5s to 1s depending on the analysis algorithm.

Run Details

5674 of 5869 relevant lines covered (96.68%)

7090.06 hits per line

Jobs

ID	Job ID	Ran	Files	Coverage
1	739.1 (PATH=$PATH:`pwd`/install/bin)	11 Dec 2015 10:10PM UTC	0	96.68	Travis Job 739.1

Source Files on build 739

Detailed source file information is not available for this build.

rakhimov / scram / 739
0%

README BADGES
x

Markdown

Textile

RDoc

HTML

Rst

Jobs

Source Files on build 739

rakhimov / scram / 739 0%

README BADGES x

Markdown

Textile

RDoc

HTML

Rst

Jobs

Source Files on build 739

rakhimov / scram / 739
0%

README BADGES
x