\
This crate is useful when you need to work with algorithms like
Dijkstra's Shortest Path or
Floyd–Warshall algorithm
that require infinite values in order to be written elegantly.
One simple example can be finding the max value in a vector: ```rust use magnitude::Magnitude;
fn find_max(vec: &Vec
max
}
let vec: Vec
# Invalid operations
* Comparison:
- two PosInfinite
- two NegInfinite
* Arithmetic:
- Add:
- PosInfinite
+ NegInfinite
- Sub:
- PosInfinit
- PosInfinit
- NegInfinit
- NegInfinit
- Mul:
- zero * PosInfinite
- zero * NegInfinite
- Div:
- non-zero / PosInfinite
- non-zero / NegInfinite
- PosInfinite
/ zero
- NegInfinite
/ zero
- PosInfinite
/ PosInfinite
- PosInfinite
/ NegInfinite
- NegInfinite
/ PosInfinite
- NegInfinite
/ NegInfinite