How to Solve The Shortest Path Problem in Grapgh 1.2
Breath Fisrt Search
Dynamic Programming 1.3
Knapsack problem
Dynamic Programming 1.2
Dynamic Programming
how to implement a queue by C
Queue
queue is a collection of entities that are maintained in a sequence and can be modified by the addition of entities at one end of the sequence and the removal of entities from the other end of the sequence. By convention, the end of the sequence at which elements are added is called the back, tail, or rear of the queue, and the end at which elements are removed is called the head or front of the queue, analogously to the words used when people line up to wait for goods or services.