Michael Young

Results 12 issues of Michael Young

@markuspf and I were looking at the documentation for "mathematical operations" functions on floats, currently Section 19.2-1, and noticed it explains the functions quite poorly. It consists of a long...

kind: enhancement
good first issue
topic: documentation

Do we have anything much to do with [map graphs](https://en.wikipedia.org/wiki/Map_graph)? We can view a map (e.g. a map of the United States) as a graph where the different regions (e.g....

question
feature-request

[`DigraphShortestPath`](https://digraphs.github.io/Digraphs/doc/chap5_mj.html#X80E9D645843973A6) and [`DigraphDijkstra`](https://digraphs.github.io/Digraphs/doc/chap5_mj.html#X79352A8286D1D8F6) are two closely related functions that both find the shortest path between two vertices, where "shortest" means "fewest edges". The algorithm they're using appears to be basically...

newcomer-friendly
not-backwards-compatible
difficulty: 1

This adds algorithms for finding shortest paths in edge-weighted digraphs, where "shortest" means "lowest total weight". Three different "shortest path" problems are solved: - All pairs: `DigraphShortestPaths(digraph)` - Single source:...

enhancement
waiting for creator input

The line ``` You need to copy the folder $BLOG_ROOT/plugins/mastodoncomments/files/assets to $BLOG_ROOT/files/assets ``` is followed by ``` cp -a plugins/mastodoncomments/files/assets files/ ``` which looks correct, but gets confused if `files/`...

I was looking at the documentation for `DotDigraph`, which includes variants such as `DotColoredDigraph`, and the examples included are problematic. For some reason they're a `` instead of ``, so...

newcomer-friendly
doc
difficulty: 1

As mentioned in #730 we want to be able to mark something in the main branch as obsolete/deprecated, so it should print a warning that it will be removed soon....

Raiyan did a bunch of good work on edge-weighted algorithms, which was made into PR #584. My latest version of this work is at https://github.com/mtorpey/Digraphs/tree/edge-weight-algorithms from which I'm making PRs...

Now that #864 will imminently fix #708, we have a `SwapDigraphs` method that allows us to avoid messing around with `!.OutNeighbours :=` statements and similar hacks. We should look for...

difficulty: 2
refactor