• Home
  • Features
  • Pricing
  • Docs
  • Announcements
  • Sign In

gnosis / dex-services
29%
master: 31%

Build:
Build:
LAST BUILD BRANCH: solver-bump-v0.8.8
DEFAULT BRANCH: master
Repo Added 13 May 2020 08:18AM UTC
Files 102
Badge
Embed ▾
README BADGES
x

If you need to use a raster PNG badge, change the '.svg' to '.png' in the link

Markdown

Textile

RDoc

HTML

Rst

LAST BUILD ON BRANCH v.0.22.0
branch: v.0.22.0
CHANGE BRANCH
x
Reset
  • v.0.22.0
  • V0.12.2
  • master
  • v0.12.0
  • v0.12.1
  • v0.12.2
  • v0.12.3
  • v0.13.0
  • v0.14.0
  • v0.15.0
  • v0.15.1
  • v0.16.1
  • v0.16.2
  • v0.17.0
  • v0.17.1
  • v0.18.0
  • v0.18.1
  • v0.21.0
  • v0.22.0
  • v0.23.0
  • v0.24.0
  • v0.25.0
  • v0.26.0
  • v0.27.0
  • v0.28.0
  • v0.29.0
  • v0.30.0
  • v0.31.0
  • v0.32.0
  • v0.33.0
  • v0.34.0
  • v0.35.0
  • v0.36.0
  • v0.37.0
  • v0.38.0
  • v0.39.0
  • v0.40.0
  • v0.41.0
  • v0.42.0
  • v0.43.0
  • v0.44.0

07 Aug 2020 02:26PM UTC coverage: 28.731%. First build
4614

push

travis-pro

web-flow
Reorganize implementation of Bellman-Ford algorithm (#1256)

* Reorganize implementation of Bellman-Ford algorithm

* Better change of starting node in a cycle

Co-authored-by: Valentin <vakevk+git@gmail.com>

* init -> new

* Self type when possible

* node_indices does not contain source in connected_nodes

* Add test for connected nodes

* Use struct with named fields for PredecessorStore

* Fix outdated comments

* Remove declaration before initialization

* Path derefs to node slice

* Negative cycle derefs to node slice

* Implement iterator for NegativeCycle

* Split negative cycle

* Simpler fill_market_ring_trade

* predecessor -> predecessors

* Bellman Ford as constructor of ShortestPathGraph

* Split cycle at node, not index

* Fix formatting

* Restore subgraph.for_each()

* Remove negative_cycle.iter()

* Path implements Eq

* Accept all valid options in overlapping order reduction test

* Fix control flow description

* Remove explicit type in subgraph creation

* Improve code readability

Co-authored-by: Nicholas Rodrigues Lordello <nlordell@gmail.com>

* Debug assertion without requiring Debug trait

Co-authored-by: Valentin <vakevk+git@gmail.com>
Co-authored-by: Nicholas Rodrigues Lordello <nlordell@gmail.com>

11837 of 47305 branches covered (25.02%)

Branch coverage included in aggregate %.

3217 of 5091 relevant lines covered (63.19%)

28323.23 hits per line

Relevant lines Covered
Build:
Build:
5091 RELEVANT LINES 3217 COVERED LINES
28323.23 HITS PER LINE
Source Files on v.0.22.0
Detailed source file information is not available for this build.

Recent builds

Builds Branch Commit Type Ran Committer Via Coverage
4614 v.0.22.0 Reorganize implementation of Bellman-Ford algorithm (#1256) * Reorganize implementation of Bellman-Ford algorithm * Better change of starting node in a cycle Co-authored-by: Valentin <vakevk+git@gmail.com> * init -> new * Self type wh... push 10 Aug 2020 07:19AM UTC web-flow travis-pro
28.73
See All Builds (2185)
  • Repo on GitHub
STATUS · Troubleshooting · Open an Issue · Sales · Support · CAREERS · ENTERPRISE · START FREE · SCHEDULE DEMO
ANNOUNCEMENTS · TWITTER · TOS & SLA · Supported CI Services · What's a CI service? · Automated Testing

© 2026 Coveralls, Inc