gnosis / dex-services

29%

master: 31%

push

travis-pro

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