Christopher Jefferson - Maths software in Rust after 20 years of C++: graph isomorphism and groups

Поділитися
Вставка
  • Опубліковано 27 жов 2024

КОМЕНТАРІ • 5

  • @ib9rt
    @ib9rt 3 місяці тому

    Watched with interest. Graph theory and row/column permutations of equivalent sparse matrices is a very important topic in computational numerical analysis, making use of Dulmage-Mendelsohn decomposition, Tarjan's algorithm, early work by Roger Sargent, and many others in the field. These all in some way or another involve searches with backtracking. The goal is generally to permute the rows and columns of a sparse matrix to achieve a result with more useful structural properties. Is this field orthogonal to your work, does it intersect with it, and might any of your work equally be useful in numerical analysis?

  • @MrWorshipMe
    @MrWorshipMe 3 місяці тому +1

    Isn't Option more appropriate than Result for noting whether the search found something or not?
    Edit: it was asked at the end :)

    • @Azubits
      @Azubits 3 місяці тому

      (author here) I also remembered a better reason for Result, if you ignore the return value of a function which returns Option, nothing happens, but if you ignore a Result, you get a warning!

    • @MrWorshipMe
      @MrWorshipMe 3 місяці тому

      @@Azubits there #[must_use] for that, no?

    • @Azubits
      @Azubits 3 місяці тому +1

      @@MrWorshipMe true, but now I need to remember to "must_use" lots and lots of methods, while 'Result' just does exactly what I want, with no obvious drawbacks, except a niggling feeling it's "not what it's for" :)