Skip to content
Permalink

Comparing changes

Choose two branches to see what’s changed or to start a new pull request. If you need to, you can also or learn more about diff comparisons.

Open a pull request

Create a new pull request by comparing changes across two branches. If you need to, you can also . Learn more about diff comparisons here.
base repository: bit-shashank/cp-algorithms
Failed to load repositories. Confirm that selected base ref is valid, then try again.
Loading
base: 546ce11
Choose a base ref
...
head repository: cp-algorithms/cp-algorithms
Failed to load repositories. Confirm that selected head ref is valid, then try again.
Loading
compare: e8b714d
Choose a head ref
  • 2 commits
  • 1 file changed
  • 2 contributors

Commits on May 2, 2025

  1. Typo fix in graph/fixed_length_paths.md 

    Replaced

It is obvious that the constructed adjacency matrix if the answer to the problem for the case  
$k = 1$ . It contains the number of paths of length  
$1$  between each pair of vertices.

To

It is obvious that the constructed adjacency matrix is the answer to the problem for the case  
$k = 1$ . It contains the number of paths of length  
$1$  between each pair of vertices.
    @bit-shashank
    bit-shashank authored May 2, 2025
    Configuration menu
    Copy the full SHA
    46e4efa View commit details
    Browse the repository at this point in the history

  2. Merge pull request cp-algorithms#1458 from bit-shashank/bit-shashank-… 

    …patch-1

Typo fix in graph/fixed_length_paths.md
    @mhayter
    mhayter authored May 2, 2025
    Configuration menu
    Copy the full SHA
    e8b714d View commit details
    Browse the repository at this point in the history
Loading