## [daily question 1] preparing for the Blue Bridge Cup -- Python programming | Day14 | path | real problem code analysis

💖 About the author: Hello, I'm brother cheshen, cheshen at No. 18 Fuxue road 🥇 ⚡ About - > Che Shen: the fastest time from the bedroom to the laboratory is 3 minutes, and the slowest time is 3.5 minutes (that half minute is actually waiting for the traffic light) 📝 Personal homepage: Drivers only need cars and hands, and the pressure com ...

Posted by **james_4k2** on *Wed, 09 Mar 2022 00:37:37 +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*

## Shortest path problem

Shortest path problem
Sequence: shortest path problem: find the weight and minimum path length from one point to another in the graph. (the following n indicates the number of points and m indicates the number of sides)
I Naive dijkstra algorithm
Principle: dijkstra algorithm is based on breadth first search and expands each poin ...

Posted by **oddyseys** on *Fri, 18 Feb 2022 21:17:43 +0100*

## Understanding of dijestra algorithm and its proof by counter proof method

Understanding of dijestra algorithm
Today, do a single source longest path problem leetcode-743 , although I immediately thought of dijestra algorithm, I became a little vague about its specific idea, so I reviewed this classic algorithm with this problem.
Overview of dijestra algorithm Dijkstra algorithm was proposed by Dutch computer scient ...

Posted by **XtacY** on *Tue, 04 Jan 2022 08:59:09 +0100*

## Chapter 5 #5.2 graph traversal and Application

Graph traversal: starting from a vertex of a connected graph, access and traverse all vertices in the graph along some edges, and each vertex is accessed only once. This is called graph traversal, which is the basic operation of the graph
Traversal essence: the process of finding the adjacency point of each vertex
Characteristics of graph: ...

Posted by **praveenhotha** on *Wed, 29 Dec 2021 21:51:23 +0100*

## SDUT 2021 Summer Individual Contest - 7 (supplementary question)

E - Charles in Charge
Topic meaning: a person riding on the road with a battery car can be charged at every point. You can run as many miles as there is electricity. Now you are required to run the distance. The smaller the battery capacity of the electric vehicle, the better. What is the minimum capacity of the electric vehicle. Idea: firs ...

Posted by **arya6000** on *Sat, 25 Dec 2021 05:22:29 +0100*

## 1003 emergency (three solutions of Dijkstra, Bellman Ford and SPFA)

catalogue
1. Dijkstra solution
2. Bellman Ford solution
3. SPFA solution
4. Dijkstra solution AC code
5. Bellman Ford solution AC code
6. Non full score (19 / 25) code of SPFA solution
1. Dijkstra solution
This problem involves not only the basic solution, but also the second standard (cumulative number of troops) and recording the numb ...

Posted by **leeroy1** on *Tue, 21 Dec 2021 11:15:58 +0100*

## Storage and shortest path problem of c + + graph

preface
Graph theory has always been my biggest headache - 2021 / 9 / 4
Now I finally don't have a headache
After grinding on dijkstra for a day, I finally realized him completely
On graph theory
Graph theory has always been the final topic in the competition, and it is also a difficult point In the popularity group, graph theory is ge ...

Posted by **kkobashi** on *Thu, 16 Dec 2021 14:52:42 +0100*

## Data structure course design -- Design of traffic consulting system

1, Problem Description:
Design of traffic consultation system
Design purpose:
Master dijestra algorithm and Floyd algorithm, and be able to use them to solve the shortest path problem.
Master the depth and breadth traversal algorithm of the graph.
Master quick sorting algorithm.
Content:
Design a traffic consulting system by reading Natio ...

Posted by **pranesh** on *Sun, 31 Oct 2021 02:17:02 +0200*