Updated reports

Author: rabestro

docs/spock-reports/aggregated_report.json

@@ -0,0 +1 @@
+{"graph.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":2,"totalFeatures":2,"passed":2,"successRate":1.0,"time":162},"title":"","narrative":""},"graph.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":46},"title":"Comparison of two algorithms","narrative":""},"graph.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":3,"totalFeatures":3,"passed":3,"successRate":1.0,"time":66},"title":"","narrative":""},"graph.GraphSpec":{"executedFeatures":["should calculate distance"],"ignoredFeatures":[],"stats":{"failures":0,"errors":0,"skipped":0,"totalRuns":1,"totalFeatures":1,"passed":1,"successRate":1.0,"time":19},"title":"","narrative":""},"graph.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":2,"totalFeatures":2,"passed":2,"successRate":1.0,"time":133},"title":"Breadth First Search Algorithm","narrative":"Breadth First Search algorithm for finding the shortest paths between nodes in a graph"},"graph.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":40},"title":"Comparison of two algorithms","narrative":""},"graph.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":3,"totalFeatures":3,"passed":3,"successRate":1.0,"time":67},"title":"Dijkstra's Algorithm","narrative":"Dijkstra's algorithm is an algorithm for finding the fastest paths between nodes in a graph"},"graph.GraphSpec":{"executedFeatures":["should be zero distance for an empty path","should be zero distance for any one node path","should calculate distance for a path","should return edges for a given node","should throw NPE for incorrect path"],"ignoredFeatures":[],"stats":{"failures":0,"errors":0,"skipped":0,"totalRuns":5,"totalFeatures":5,"passed":5,"successRate":1.0,"time":125},"title":"Generic Graph","narrative":"A generic implementation of Graph structure"}}

target/spock-reports/algorithm.BreadthFirstSearchSpec.html renamed to docs/spock-reports/graph.BreadthFirstSearchSpec.html

@@ -251,7 +251,7 @@ <h2>Report for graph.BreadthFirstSearchSpec</h2>
 </div>
 <div class='summary-report'>
 <h3>Summary:</h3>
-<div class='date-test-ran'>Created on Mon Dec 27 22:21:38 EET 2021 by rabes</div>
+<div class='date-test-ran'>Created on Sun Jan 02 19:39:17 EET 2022 by rabes</div>
 <table class='summary-table'>
 <thead>
 <tr>
@@ -272,11 +272,21 @@ <h3>Summary:</h3>
 <td>0</td>
 <td>0</td>
 <td>100.0%</td>
-<td>0.039 seconds</td>
+<td>0.133 seconds</td>
 </tr>
 </tbody>
 </table>
 </div>
+<pre class='title'>Breadth First Search Algorithm</pre>
+<pre class='narrative'>Breadth First Search algorithm for finding the shortest paths between nodes in a graph</pre>
+<div class='issues'>
+<div>See:</div>
+<ul>
+<li>
+<a href='https://en.wikipedia.org/wiki/Breadth-first_search'>https://en.wikipedia.org/wiki/Breadth-first_search</a>
+</li>
+</ul>
+</div>
 <h3>Features:</h3>
 <table class='features-table'>
 <colgroup>
@@ -325,13 +335,13 @@ <h3>Features:</h3>
 <div class='block-kind'>When:</div>
 </td>
 <td>
-<div class='block-text'>we use Breadth First Search graph to find a path</div>
+<div class='block-text'>we use Breadth First Search algorithm to find a path</div>
 </td>
 </tr>
 <tr>
 <td></td>
 <td>
-<pre class='block-source'>def path = graph.findPath(graph, source, target)</pre>
+<pre class='block-source'>def path = algorithm.findPath(graph, source, target)</pre>
 </td>
 </tr>
 <tr>
@@ -449,13 +459,13 @@ <h3>Features:</h3>
 <div class='block-kind'>When:</div>
 </td>
 <td>
-<div class='block-text'>we use Breadth First Search graph to find a path</div>
+<div class='block-text'>we use Breadth First Search algorithm to find a path</div>
 </td>
 </tr>
 <tr>
 <td></td>
 <td>
-<pre class='block-source'>def path = graph.findPath(graph, source, target)</pre>
+<pre class='block-source'>def path = algorithm.findPath(graph, source, target)</pre>
 </td>
 </tr>
 <tr>

target/spock-reports/algorithm.DijkstrasAlgorithmSpec.html renamed to docs/spock-reports/graph.DijkstrasAlgorithmSpec.html

@@ -251,7 +251,7 @@ <h2>Report for graph.DijkstrasAlgorithmSpec</h2>
 </div>
 <div class='summary-report'>
 <h3>Summary:</h3>
-<div class='date-test-ran'>Created on Mon Dec 27 22:21:38 EET 2021 by rabes</div>
+<div class='date-test-ran'>Created on Sun Jan 02 19:39:17 EET 2022 by rabes</div>
 <table class='summary-table'>
 <thead>
 <tr>
@@ -272,11 +272,21 @@ <h3>Summary:</h3>
 <td>0</td>
 <td>0</td>
 <td>100.0%</td>
-<td>0.073 seconds</td>
+<td>0.067 seconds</td>
 </tr>
 </tbody>
 </table>
 </div>
+<pre class='title'>Dijkstra's Algorithm</pre>
+<pre class='narrative'>Dijkstra's algorithm is an algorithm for finding the fastest paths between nodes in a graph</pre>
+<div class='issues'>
+<div>See:</div>
+<ul>
+<li>
+<a href='https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm'>https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm</a>
+</li>
+</ul>
+</div>
 <h3>Features:</h3>
 <table class='features-table'>
 <colgroup>
@@ -328,13 +338,13 @@ <h3>Features:</h3>
 <div class='block-kind'>When:</div>
 </td>
 <td>
-<div class='block-text'>we use Dijkstra's graph to find a path</div>
+<div class='block-text'>we use Dijkstra's algorithm to find a path</div>
 </td>
 </tr>
 <tr>
 <td></td>
 <td>
-<pre class='block-source'>def path = graph.findPath(graph, source, target)</pre>
+<pre class='block-source'>def path = algorithm.findPath(graph, source, target)</pre>
 </td>
 </tr>
 <tr>
@@ -452,13 +462,13 @@ <h3>Features:</h3>
 <div class='block-kind'>When:</div>
 </td>
 <td>
-<div class='block-text'>we use Dijkstra's graph to find a path</div>
+<div class='block-text'>we use Dijkstra's algorithm to find a path</div>
 </td>
 </tr>
 <tr>
 <td></td>
 <td>
-<pre class='block-source'>def path = graph.findPath(graph, source, target)</pre>
+<pre class='block-source'>def path = algorithm.findPath(graph, source, target)</pre>
 </td>
 </tr>
 <tr>
@@ -593,13 +603,13 @@ <h3>Features:</h3>
 <div class='block-kind'>When:</div>
 </td>
 <td>
-<div class='block-text'>we use Dijkstra's graph to find a path</div>
+<div class='block-text'>we use Dijkstra's algorithm to find a path</div>
 </td>
 </tr>
 <tr>
 <td></td>
 <td>
-<pre class='block-source'>def path = graph.findPath(graph, source, target)</pre>
+<pre class='block-source'>def path = algorithm.findPath(graph, source, target)</pre>
 </td>
 </tr>
 <tr>