Rank-1 Divisors on graphs
The code in the following github repository calculates the v-reduced representative of a divisor on a finite graph. It also calculates the rank of a divisor and bruteforces all the rank-1 divisors on a graph. In my opinion it is decently fast, despite having written it in a scripting language. I am open to writing new functionalities for this code, contact me if you have ideas of possible uses.