Guruh talabasi Ahmadjon Turgunov -8-9-10-11-12-labaratoriyalar laboratoriya ishi mavzu

#include
using namespace std;
class Graph {
// A function used by DFS
void DFSUtil(char v);
public:
map visited;
map > adj;
// function to add an edge to graph
void addEdge(char v, char w);
// prints DFS traversal of the complete graph
void DFS();
};
void Graph::addEdge(char v, char w)
{
adj[v].push_back(w); // Add w to v’s list.
}
void Graph::DFSUtil(char v)
{
// Mark the current node as visited and print it
visited[v] = true;
cout << v << " ";
// Recur for all the vertices adjacent to this vertex
list::iterator i;
for (i = adj[v].begin(); i != adj[v].end(); ++i)
if (!visited[*i])
DFSUtil(*i);
}
// The function to do DFS traversal. It uses recursive
// DFSUtil()
void Graph::DFS()
{
// Call the recursive helper function to print DFS
// traversal starting from all vertices one by one
for (auto i : adj)
if (visited[i.first] == false)
DFSUtil(i.first);
}
// Driver Code
int main()
{
// Create a graph given in the above diagram
Graph g;
g.addEdge('A', 'h');
g.addEdge('h', 'm');
g.addEdge('m', 'a');
g.addEdge('a', 'd');
g.addEdge('d', 'j');
g.addEdge('j', 'o');
g.addEdge('o', 'n');
cout << "Following is Depth First Traversal \n";
g.DFS();
return 0;
}

LABORATORIYA ISHI - 10
Mavzu: Chiziqli dasturlash masalalarini yechishda yechishda simpleks usul algoritmi va dasturi.
Ishdan maqsad. Chiziqli dasturlash masalalarini yechishda yechishda simpleks usul algoritmi va dasturini o’rganish.
Qo’yilgan masala. Chiziqli dasturlash masalalarini yechishda yechishda simpleks usul algoritmi va dasturi
Ish tartibi:

• 
  Tajriba ishi nazariy ma’lumotlarini o‘rganish;
  
• 
  Berilgan topshiriqning algoritmini ishlab chiqish;
  
• 
  C++ dasturlash muhitida dasturni yaratish;
  
• 
  Natijalarni tekshirish;
  
• 
  Hisobotni tayyorlash va topshirish.
  
• 
  Ustoz baho qo’yberaman degansiz