Thanks for Your best educational videos Farhan Hossan Bhaiya. This Video helped in my semester final exam. I appreciate for your work and hope you will make more educational videos that will benefit us ❤
Eta formula chara kora jabe.....je element ta ber kora hobe...D4 er elemenr=min( D3 er oi element,(D3 er oi element borabor row borabor 4 no element +column borabor 4 no element)) ekane 4 holo D4 er 4
No, the Floyd-Warshall algorithm is not typically used for finding a spanning subgraph of a graph. The Floyd-Warshall algorithm is primarily used for finding the shortest path between all pairs of vertices in a weighted graph. It works by considering all possible paths between each pair of vertices and selecting the shortest one. A spanning subgraph, on the other hand, is a subgraph that includes all vertices of the original graph but only some of its edges. There are other algorithms that are more suitable for finding a spanning subgraph, such as Kruskal's algorithm or Prim's algorithm, which are specifically designed for finding the minimum spanning tree of a weighted graph.
Amazing. Lots of Du'a to you from us, bhaiya. For your generous help and hard work. May Allah make you successful in the best way.
Our teacher should try this video
Thanks for Your best educational videos Farhan Hossan Bhaiya. This Video helped in my semester final exam. I appreciate for your work and hope you will make more educational videos that will benefit us ❤
Appreciate your work king 👑
woooow very good vhaia best of luck
apnar video gula topic gula k bujte ro easy kore deye💜
easy jinish tare eto critical kore bujhanor mane ta ki.. ekta din baad korlam apnar ai video ta dekhe.tore onno ekta video dekha martoe bujhe felsi.
Vaiya... Apni D^4 ar somoy row kolam D^3 theke na niye D^2 theke kno nichen?🙄
Apu it was a mistake .
Please consider from D3
@@FarhanHossan ok vaiya.... Ami bujte parchilm seta, ami thikvabei korchi😊
Sir , D^4 a [2,4]
postion a ki 4 hobe ?
the savior
Vai D4 e (2,4) e 4 hobe maybe.Vul kore Infinity disen maybe.
Hmm
vaiya, D4 er 4th row ar colum D3 theke nibo na? eikhane to D2 theke newa
Yes,
Sorry it was a mistake
@@FarhanHossan prai sob video tei apni mistake koren. video dewar agey 100% sure hoya uchit. student ra confused hoy
@@FarhanHossan Thanks brother for your kind information
Eta formula chara kora jabe.....je element ta ber kora hobe...D4 er elemenr=min( D3 er oi element,(D3 er oi element borabor row borabor 4 no element +column borabor 4 no element)) ekane 4 holo D4 er 4
vai 2,3 to 3 howar kotha,,sei hisabe d4 e 2,4 e 5 ashbe
if there have self move then is diagonally will be zero?
yes diagonally cost always zero for self loop.
2:30 minit er xm -a aita korteci to 40 minit jabe ga, sir ra DS-a aita keno likte dei buji na.
vaia please reply me "is this algorithm use for spanning subgraph"
No, the Floyd-Warshall algorithm is not typically used for finding a spanning subgraph of a graph.
The Floyd-Warshall algorithm is primarily used for finding the shortest path between all pairs of vertices in a weighted graph. It works by considering all possible paths between each pair of vertices and selecting the shortest one.
A spanning subgraph, on the other hand, is a subgraph that includes all vertices of the original graph but only some of its edges. There are other algorithms that are more suitable for finding a spanning subgraph, such as Kruskal's algorithm or Prim's algorithm, which are specifically designed for finding the minimum spanning tree of a weighted graph.
5:00 ei je vi ekhane bolsen je jotogula vertices totogula matrix hbe
Evabe maan ber korle 2 year lege jabe sesh Korte
2 to 4 path value infinity hobe na 4 hobe
D4 er (2,4) e 4 hbe may be. Infinity disen.
You are r8 bro
D4 er 4th row ar colum D3 theke nibo . vedio te D2 theke newa
💚
Sera
Matrix na korle ki hobe?