Skip to content

Commit e9c060f

Browse files
committed
Add SpockConfig.groovy
1 parent 07b71f5 commit e9c060f

File tree

8 files changed

+4266
-15
lines changed

8 files changed

+4266
-15
lines changed

src/test/groovy/algorithm/SearchAlgorithmSpec.groovy

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -13,7 +13,6 @@ class SearchAlgorithmSpec extends Specification {
1313
@Subject
1414
def dijkstras = new DijkstrasAlgorithm<String>()
1515

16-
@Issue("https://github.com/rabestro/graph-search-algorithm-java/blob/master/docs/complex.gif")
1716
def 'should find a route for a complex graph'() {
1817
given: 'A complex graph sample'
1918
def graph = new Graph<String>([
Lines changed: 12 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,12 @@
1+
spockReports {
2+
set 'com.athaydes.spockframework.report.showCodeBlocks': true
3+
set 'com.athaydes.spockframework.report.outputDir': 'target/spock-reports'
4+
set 'com.athaydes.spockframework.report.projectName': 'Graph search algorithms'
5+
set 'com.athaydes.spockframework.report.projectVersion': 1.0
6+
7+
set "com.athaydes.spockframework.report.template.TemplateReportCreator.specTemplateFile": "/templateReportCreator/spec-template.md"
8+
set "com.athaydes.spockframework.report.template.TemplateReportCreator.reportFileExtension": "md"
9+
set "com.athaydes.spockframework.report.template.TemplateReportCreator.summaryTemplateFile": "/templateReportCreator/summary-template.md"
10+
set "com.athaydes.spockframework.report.template.TemplateReportCreator.summaryFileName": "summary.md"
11+
set "com.athaydes.spockframework.report.template.TemplateReportCreator.enabled": true
12+
}
Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1 @@
1+
{"algorithm.SearchAlgorithmSpec":{"executedFeatures":["should find a route for a complex graph"],"ignoredFeatures":[],"stats":{"failures":0,"errors":0,"skipped":0,"totalRuns":1,"totalFeatures":1,"passed":1,"successRate":1.0,"time":142},"title":"Comparison of two algorithms","narrative":""},"algorithm.GraphSpec":{"executedFeatures":["should calculate distance"],"ignoredFeatures":[],"stats":{"failures":0,"errors":0,"skipped":0,"totalRuns":8,"totalFeatures":1,"passed":8,"successRate":1.0,"time":121},"title":"","narrative":""},"algorithm.SearchAlgorithmSpec":{"executedFeatures":["should find a route for a complex graph"],"ignoredFeatures":[],"stats":{"failures":0,"errors":0,"skipped":0,"totalRuns":1,"totalFeatures":1,"passed":1,"successRate":1.0,"time":57},"title":"Comparison of two algorithms","narrative":""},"algorithm.DijkstrasAlgorithmSpec":{"executedFeatures":["should find a route for a complex graph","should find a route for a medium graph","should find a route for a simple graph"],"ignoredFeatures":[],"stats":{"failures":0,"errors":0,"skipped":0,"totalRuns":22,"totalFeatures":3,"passed":22,"successRate":1.0,"time":64},"title":"","narrative":""},"algorithm.BreadthFirstSearchSpec":{"executedFeatures":["should find a route for complex graph","should find a route for simple graph"],"ignoredFeatures":[],"stats":{"failures":0,"errors":0,"skipped":0,"totalRuns":11,"totalFeatures":2,"passed":11,"successRate":1.0,"time":41},"title":"","narrative":""},"algorithm.GraphSpec":{"executedFeatures":["should calculate distance"],"ignoredFeatures":[],"stats":{"failures":0,"errors":0,"skipped":0,"totalRuns":8,"totalFeatures":1,"passed":8,"successRate":1.0,"time":108},"title":"","narrative":""},"algorithm.SearchAlgorithmSpec":{"executedFeatures":["should find a route for a complex graph"],"ignoredFeatures":[],"stats":{"failures":0,"errors":0,"skipped":0,"totalRuns":1,"totalFeatures":1,"passed":1,"successRate":1.0,"time":49},"title":"Comparison of two algorithms","narrative":""},"algorithm.DijkstrasAlgorithmSpec":{"executedFeatures":["should find a route for a complex graph","should find a route for a medium graph","should find a route for a simple graph"],"ignoredFeatures":[],"stats":{"failures":0,"errors":0,"skipped":0,"totalRuns":22,"totalFeatures":3,"passed":22,"successRate":1.0,"time":58},"title":"","narrative":""},"algorithm.BreadthFirstSearchSpec":{"executedFeatures":["should find a route for complex graph","should find a route for simple graph"],"ignoredFeatures":[],"stats":{"failures":0,"errors":0,"skipped":0,"totalRuns":11,"totalFeatures":2,"passed":11,"successRate":1.0,"time":27},"title":"","narrative":""}}

0 commit comments

Comments
 (0)