> For the complete documentation index, see [llms.txt](https://phitron.gitbook.io/algorithm/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://phitron.gitbook.io/algorithm/undefined-1/_.md).

# মডিউল ১৪\_০ঃ ইনট্রডাকশন

আজকে আমরা গ্রাফের কিছু অ্যালগরিদম দিয়ে কিছু প্রব্লেম সল্ভিং করবো এবং একটা প্রব্লেমকে কিভাবে চিন্তা করতে হয়, কিভাবে identify করতে হয় যে সেই প্রব্লেমটি কোন অ্যালগরিদম দিয়ে সমাধান করবো সেইটি দেখবো। <br>

* [Romeo and Juliet - Hackerrank](https://www.hackerrank.com/contests/phitron-monthly-programming-contest-a-batch-04-a-feb-2024/challenges/romeo-and-juliet-2)

***

* You live in a city where there are N buildings, and E roads connect those buildings. Each road has a distance, and they are two-way roads. You want to start a business in your city where you will provide ISP service. For that reason, you need to connect all buildings with your central wire cable through the roads. As the price of optical fiber is high, you want to reduce the cost as much as possible. If you know the distance of the roads, can you calculate the minimum cost to connect all buildings with your cable? The cost of optical fiber is equal to the distance of any road.

  Sample Input:

  6 10

  0 1 5

  0 2 6

  0 3 8

  0 4 6

  0 5 10

  3 5 2

  5 1 4

  1 2 3

  2 4 8

  4 3 6

***

* [C. Dijkstra? - Codeforces](https://codeforces.com/problemset/problem/20/C)

***

* [CSES - Building Roads](https://cses.fi/problemset/task/1666/)

***

* [CSES - Message Route](https://cses.fi/problemset/task/1667/)