## Challenge program design: codeforces round #776 (Div. 3) g. counting shortcuts

Title portal
Main idea of the title:
Given an undirected graph G without self ring and mu lt iple edges, as well as the starting point and end point S and T, the edge weight is 1, find the path length from S to T < = the number of shortest path length + 1.
Problem solving ideas
Since the edge weight length is constant as 1, the shortest ...

Posted by **ThEMakeR** on *Wed, 09 Mar 2022 10:18:26 +0100*

## Brief analysis of AntV X6 source code

prefaceAntV It is a new generation of data visualization solution of ant financial services. X6 is mainly used to solve the solutions related to the field of graph editing. It is a graph editing engine with built-in functions and components required by the editor. This paper aims to have a general understanding of some underlying engines in the ...

Posted by **char skd1** on *Sun, 06 Mar 2022 14:42:47 +0100*

## The second week of 2022

A.Binary Tree
meaning of the title If the root is (a,b), the left child is (a+b,b) and the right child is (a,a+b). Given (m,n), the initial root is (1,1). From (1,1) to (m,n), you need to walk several times to the left subtree and several times to the right subtree. Problem solving ideas Idea 1: reverse thinking, from (m,n) to (1,1). Given (m, ...

Posted by **andymelton** on *Sun, 06 Mar 2022 07:04:04 +0100*

## Maze box four color theorem digital grouping problem solution

1. Maze
Title Description
Recently, little Y is playing a maze game. The game is played on an n * m grid. Each grid may be an open space or an obstacle. At the beginning of the game, the character controlled by the player is located in an open space in the figure. During the game, players can use the up, down, left and right keys to control ...

Posted by **ryanhowdy** on *Fri, 04 Mar 2022 21:02:52 +0100*

## Shandong University of science and technology 2021 national ladder competition pre competition individual topic intensive competition -- 4 (shortest path) supplementary questions

Save 007 (upgraded)
In the old movie "Live and Let Die", 007 is caught by a drug dealer on an island in the center of a crocodile pool. He uses an extremely bold way to escape - stepping directly on the brain bags of a series of crocodiles in the pool and jumping ashore! (it is said that the stuntman was bitten by the last crocodile. ...

Posted by **Eric!** on *Fri, 04 Mar 2022 20:14:38 +0100*

## Comparison of konjaku -- spfa and dijkstra

Because I haven't played the shortest board for a long time, I almost forgot the two algorithms... floyd is too simple, so I remember QAQ
No, let's play the board first. You can practice with two questions:
Weakened version: [template] single source shortest path (weakened version) - Luogu
Enhanced version: [template] single source shortest ...

Posted by **bibie** on *Thu, 03 Mar 2022 07:18:41 +0100*

## NC14608 after and maze bfs

After's algorithm book is left in a maze called AIJ. This maze has N*M rooms, the entrance of the maze is (1, 1), and the algorithm book is left in (r, c). The rooms in the maze have four states: empty rooms, inaccessible rooms, rooms with Mephisto and rooms with Lilith. Mephisto will deny everything, and Lilith will tempt people to do an activ ...

Posted by **Liodel** on *Wed, 02 Mar 2022 13:38:19 +0100*

## Shortest path algorithm

1.Dijkstra algorithm
1.1 algorithm flow interpretation
1. Initialization:
The shortest path length of the starting point is set to zero, and the shortest path length of the other points is set to positive infinity.
2.n wheel slack:
Dij algorithm divides the points into the set of points with the shortest path and the set of points without ...

Posted by **dk1983** on *Sun, 27 Feb 2022 14:19:09 +0100*

## L2-016 wish all lovers in the world are brothers and sisters who have been separated for many years (25 points)

L2-016 wish all lovers in the world are brothers and sisters who have been separated for many years (25 points) ha-ha. We all know that intermarriage is not allowed within five clothes, that is, if the nearest common ancestor of two people is within five generations (i.e. myself, parents, grandparents, great grandparents and high grandparents), ...

Posted by **WickedStylis** on *Sat, 26 Feb 2022 17:21:51 +0100*

## 10 commonly used algorithms (8 ~ 10)

10 commonly used algorithms (8 ~ 10)
1, Dijkstra algorithm
Application scenario - shortest path problem
[the external chain image transfer fails. The source station may have an anti-theft chain mechanism. It is recommended to save the image and upload it directly (img-g8rjj2vk-1645791772844) (C: \ users \ Luo'xin \ appdata \ roaming \ typora ...

Posted by **skorp** on *Fri, 25 Feb 2022 13:29:37 +0100*