Toshpulatov Jasurbekning "Algoritmlarni loyihalash"

void Graph::DFS(int v)

• 
  void Graph::DFS(int v)
  
• 
  {
  
• 
  bool *visited = new bool[V];
  
• 
  for (int i = 0; i < V; i++)
  
• 
  visited[i] = false;
  
• 
  DFSUtil(v, visited);
  
• 
  }
  
• 
  int main(){
  
• 
  Graph g(4);g.addEdge(0, 1);
  
• 
  g.addEdge(0, 2);
  
• 
  g.addEdge(1, 2);
  
• 
  g.addEdge(2, 0);
  
• 
  g.addEdge(2, 3);
  
• 
  g.addEdge(3, 3);
  
• 
  cout << "gragning chuqurliga"
  
• 
  " (2 dan boshlab) \n";
  
• 
  g.DFS(2);
  
• 
  return 0; }
  

ENG QISQA YO`LNI TOPISH UCHUN KOMMIVOYAJER MASALASI:

Kiritish: (G, d), turlar to'plami va H butun son shundayki, 1 ≤ k ≤ |H|
Natija: (G, d) dagi eng yaxshi turlarning H(k) toʻplami.

Qidirish protsedurasi(I, O, G)

Begin
Find (LB(I, O)) for (G, d)
If (LB(I, O) Then if |I| = n-1
Then begin
7If(|G| = k)
Then
G = G ∪ {H}
If (|G| = k)
Then
Else begin
Find a branching edge E
EXPLORE (I∪{e},O,G)
Find LB(I, O∪ {e} taking into account (G, d)
If (LB(I, O∪ {e}) Then
EXPLORE (I, O∪ {e}, G)
End
Begin
U <= ∞
H(k) <= 0
EXPLORE (0, 0, H(k))
End

Xulosa o`rnida shuni aytish mumkinki Kommivoyajer masalasi yordamida chiziqli analitik hisoblashlar, grafikli kombinatorika va jadvalli masalalarni yechishning eng yaxshi qisqa usullarini toppish mumkin. Hamda yuqorida korib otilgan usullar yordamida berilgan masalaning eng optimal yechimini toppish nazarda tutilgan.

FOYDALINILGAN ADABIYOTLAR:

1. 
   Qobilov S.S., Jumanov I.I. SUBD i informasionniye sistemi. – Samarqand: SamDU. - 1997.
   
2. 
   Количественные методы в экономических исследованиях: Учебник для вузов// Под ред. Ш.В. Грачевой, М.Н. Фадеевой, Ю.Н. Черёмных - М.: ЮНИТИ –ДИАНА, 2004.
   
3. 
   Safaeva Q. Matematik dasturlash. Darslik, “Iqtisod-Moliya” nashriyoti, -Т.: 2004.
   
4. 
   Corman H. Thomas, Leiserson E. Charles, Rivest L. Ronald, Stein Clifford “Introduction to Algorithms” Second Edition McGrawHill Book Company