11
77%
master: 77%

Ran 01 Jul 2020 10:51PM UTC

Files 468

Run time 1min

Badge

Embed ▾

Committed 01 Jul 2020 10:17PM UTC coverage: 76.771% (+0.04%) from 76.727%

Job # TAGS="-tags appengine"

Build Type

push

travis-ci

Committed by

kortschak

Commit Message

graph: make graph analysis routines safe for indeterminate iterators

This is a change in design for the graph.NodesOf family of functions. The
alternative was to provide an equivalent set of non-panicking routines in
graph for internal use. The protection that was intended with the panic
was to panic early rather than late when an indeterminate iterator exhausts
slice index space. I think in hindsight this was an error and we should
let things blow up in that (likely rare) situation.

The majority of changes are in test code. Outside the iterator package, which
is intimately tied to the determined iterator implementations, only one test
now fails if an indeterminate iterator is used, product's Modular extended
sub-graph isomorphism example, which is an algorithm that would have time
complexity issues with large iterators anyway.

Coverage Stats

56098 of 73072 relevant lines covered (76.77%)

0.89 hits per line

gonum / gonum / 5526 / 11
77%
master: 77%

README BADGES
x

Markdown

Textile

RDoc

HTML

Rst

Source Files on job 5526.11 (TAGS="-tags appengine")

gonum / gonum / 5526 / 11 77% master: 77%

README BADGES x

Markdown

Textile

RDoc

HTML

Rst

Source Files on job 5526.11 (TAGS="-tags appengine")

gonum / gonum / 5526 / 11
77%
master: 77%

README BADGES
x