Skip to content

Final docs fix for v0.1.2 #58

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
Luis-Varona merged 1 commit into from
Aug 13, 2025
Merged

Final docs fix for v0.1.2 #58

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion src/SDiagonalizability.jl
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -7,7 +7,7 @@
"""
SDiagonalizability

A dynamic algorithm to minimize or recognize the S-bandwidth of an undirected graph.
A dynamic algorithm to minimize or recognize the ``S``-bandwidth of an undirected graph.

Given an undirected, possibly weighted graph ``G`` and finite set of integers ``S`` ⊂ ``ℤ``,
``G`` is said to be "``S``-diagonalizable" if there exists some diagonal matrix ``D`` and
Expand Down