This document presents an overview of the Floyd-Warshall algorithm. It begins with an introduction to the algorithm, explaining that it finds shortest paths in a weighted graph with positive or negative edge weights. It then discusses the history and naming of the algorithm, attributed to researchers in the 1950s and 1960s. The document proceeds to provide an example of how the algorithm works, showing the distance and sequence tables that are updated over multiple iterations to find shortest paths between all pairs of vertices. It concludes with discussing the time and space complexity, applications, and references.
The solution to the single-source shortest-path tree problem in graph theory. This slide was prepared for Design and Analysis of Algorithm Lab for B.Tech CSE 2nd Year 4th Semester.
One of the main reasons for the popularity of Dijkstra's Algorithm is that it is one of the most important and useful algorithms available for generating (exact) optimal solutions to a large class of shortest path problems. The point being that this class of problems is extremely important theoretically, practically, as well as educationally.
The solution to the single-source shortest-path tree problem in graph theory. This slide was prepared for Design and Analysis of Algorithm Lab for B.Tech CSE 2nd Year 4th Semester.
One of the main reasons for the popularity of Dijkstra's Algorithm is that it is one of the most important and useful algorithms available for generating (exact) optimal solutions to a large class of shortest path problems. The point being that this class of problems is extremely important theoretically, practically, as well as educationally.
The Bellman–Ford algorithm is an algorithm that computes shortest paths from a single source vertex to all of the other vertices in a weighted digraph.
This presentation gives a conceptual idea of a graphical algorithm that is Dijkstra's Algorithm. Includes general introduction , the pseudocode, code in form of QR Card, graphical. Also discussing the algorithm in form of graphical images and nodes. Also it include the complexity and application of algorithm in various ranges of fields. This is a fun, eye-catching, conceptual presentation, best suited for students into engineering.
It is related to Analysis and Design Of Algorithms Subject.Basically it describe basic of topological sorting, it's algorithm and step by step process to solve the example of topological sort.
In mathematics, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects.Graph theory is also important in real life.
The Bellman–Ford algorithm is an algorithm that computes shortest paths from a single source vertex to all of the other vertices in a weighted digraph.
This presentation gives a conceptual idea of a graphical algorithm that is Dijkstra's Algorithm. Includes general introduction , the pseudocode, code in form of QR Card, graphical. Also discussing the algorithm in form of graphical images and nodes. Also it include the complexity and application of algorithm in various ranges of fields. This is a fun, eye-catching, conceptual presentation, best suited for students into engineering.
It is related to Analysis and Design Of Algorithms Subject.Basically it describe basic of topological sorting, it's algorithm and step by step process to solve the example of topological sort.
In mathematics, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects.Graph theory is also important in real life.
When a device has multiple paths to reach a destination, it always selects one path by preferring it over others. This selection process is termed as Routing. Routing is done by special network devices called routers or it can be done by means of software processes.The software based routers have limited functionality and limited scope.In case there are multiple path existing to reach the same destination, router can make decision based on Hop Count, Bandwidth, Metric, Prefix-length or Delay. Routing decision in networks, are mostly taken on the basis of cost between source and destination. Hop count plays major role here. Shortest path is a technique which uses various algorithms to decide a path with minimum number of hops. Common shortest path algorithms are Dijkstra's algorithm, Bellman Ford algorithm or Floyd algorithm. This presentation simplifies Floyd's algorithm with pictures and example.
Generalized capital investment planning of oil-refineries using MILP and sequ...optimizatiodirectdirect
Abstract
Performing capital investment planning (CIP) is traditionally done using linear (LP) or nonlinear (NLP) models whereby a gamut of scenarios are generated and manually searched to make expand and/or install decisions. Though mixed-integer nonlinear (MINLP) solvers have made significant advancements, they are often slow for industrial expenditure optimizations. We propose a more tractable approach using mixed-integer linear (MILP) model and input-output (Leontief) models whereby the nonlinearities are approximated to linearized operations, activities, or modes in large-scaled flowsheet problems. To model the different types of CIP's known as revamping, retrofitting, and repairing, we unify the modeling by combining planning balances with the scheduling concepts of sequence-dependent changeovers to represent the construction, commission, and correction stages explicitly. Similar applications can be applied to process design synthesis, asset allocation and utilization, and turnaround and inspection scheduling. Two motivating examples illustrate the modeling, and a retrofit example and an oil-refinery investment planning are highlighted.
LEVEL # 1
Area bounded by a curve
Q.1 The area between the curves y = 6 – x – x2
and x-axis is -
(A) 125/6 (B) 125/2
(C) 25/6 (D) 25/2
Q.2 The area between the curve y =ex and x-axis which lies between x = – 1 and x = 1 is-
(A) e2 – 1 (B) (e2 –1)/e
(C) (1–e)/e (D) ( e– 1)/e2
Q.3 The area bounded by the curve y = sin 2x,
Q.9 The area bounded by the curve y = 1 + 8/x2, x-axis, x = 2 and x = 4 is-
(A) 2 (B) 3 (C) 4 (D) 5
Q.10 The area between the curve y = log x and x-axis which lies between x = a and x = b (a > 1, b > 1) is-
(A) b log (b/e) – a log (a/e)
(B) b log (b/e) + a log (a/e)
(C) log ab
(D) log (b/a)
Q.11 Area bounded by the curve y = xex2 , x- axis and the ordinates x = 0, x = is-
x- axis and the ordinate x = /4 is- (A) /4 (B) /2 (C) 1 (D) 1/2
(A)
e2 1
2
sq. units (B)
e2 1
2
sq.units
Q.4 The area between the curve xy = a2, x-axis, x = a and x = 2a is-
(A) a log 2 (B) a2 log 2
(C)
e 2
1 sq. units (D)
e 2
1sq.units
(C) 2a log 2 (D) None of these
Q.5 Area under the curve y = sin 2x + cos 2x
between x = 0 and x = 4 , is-
(A) 2 sq. units (B) 1 sq. units
(C) 3 sq. units (D) 4 sq. units
Q.6 The area bounded by the curve y = 4x2 ; x = 0, y = 1 and y = 4 in the first quadrant is-
Q.12 The area bounded between the curve y = 2x2 + 5, x-axis and ordinates x = – 2 and x = 1 is-
(A) 21 (B) 29/5 (C) 23 (D) 24
Q.13 Area bounded by curve xy = c, x-axis between x = 1 and x = 4, is-
(A) c log 3 sq. units
(B) 2 log c sq. units
(C) 2c log 2 sq. units
(D) 2c log 5 sq. units
2 1
(A) 2 3 (B) 3 3
Q.14 The area bounded by the curve y = x sin x2,
(C) 2 1
3
(D) 3 1
2
x-axis and x = 0 and x =
is-
Q.7 The area between the curve y = sec x and y-axis when 1 y 2 is-
(A) 1/2 (B) 1/
(C) 1/4 (D) /2
(A)
2 – log ( 2 + )
3
Q.15 The area bounded between the curve
x – y + 1 = 0, x = – 2, x = 3 and x-axis is-
2 4 2
(B) 3 + log ( 2 + )
(C) – 1 log (2 + )
(A) 45/4 (B) 45/2
(C) 15 (D) 25/2
Q.16 The area bounded by curves y = tan x,
3 2
(D) None of these
Q.8 The area bounded by the lines y = x, y = 0
x- axis and x =
3 is-
and x = 2 is-
(A) 2 log 2 (B) log 2
(A) 1 (B) 2
(C) log
FG2
J (D) 0
(C) 4 (D) None of these
H3 K
Q.17 The area between the curve x2 = 4ay, x-axis, and ordinate x = d is-
(A) d3 /12a (B) d3/a
(C) d3/2a (D) d3/6a
Q.18 Area bounded by the curve y = x (x – 1)2 and x-axis is-
(A) 4 (B) 1/3 (C) 1/12 (D) 1/2
Q.19 The area bounded by the curve y = loge x, x-axis and ordinate x = e is-
(A) loge2 (B) 1/2 unit
(C) 1 unit (D) e unit
1
Q.20 The area bounded by the curve y = cos 2 x ,
Q.28 The area of a loop bounded by the curve y = a sin x and x-axis is-
(A) a (B) 2a2 (C) 0 (D) 2a
Q.29 The area between the curves x = 2 – y – y2 and y-axis is-
(A) 9 (B) 9/2 (C) 9/4 (D) 3
Q.30 The area bounded by y = 4x – x2 and the x-axis is-
(A) 30/7 (B) 31/7 (C
LEVEL # 1
Questions
based on
inequation
Q.8 If x2 – 1 0 and x2 – x – 2 0, then x line in the interval/set
(A) (–1, 2) (B) (–1, 1)
Q.1 The inequality
2 < 3 is true, when x belongs to-
x
(C) (1, 2) (D) {– 1}
2
2
Questions Definition of function
(A) 3 ,
(B) 3
based on
2 ,
Q.9 Which of the following relation is a function ?
(C)
x 4
(–, 0) (D) none of these
(A) {(1,4), (2,6), (1,5), (3,9)}
(B) {(3,3), (2,1), (1,2), (2,3)}
(C) {(1,2), (2,2,), (3,2), (4,2)}
(D) {(3,1), (3,2), (3,3), (3,4)}
Q.2
x 3 < 2 is satisfied when x satisfies-
(A) (–, 3) (10, ) (B) (3, 10)
(C) (–, 3) [10, ) (D) none of these
Q.10 If x, y R, then which of the following rules is not a function-
(A) y = 9 –x2 (B) y = 2x2
x 7
(C) y = – |x| (D) y = x2 + 1
Q.3 Solution of x 3 > 2 is-
Questions Even and odd function
(A) (–3, ) (B) (–, –13)
(C) (–13, –3) (D) none of these
2x 3
based on
Q.11 Which one of the following is not an odd function -
Q.4 Solution of
3x 5
3 is-
(A) sin x (B) tan x
(C) tanh x (D) None of these
12 5 12
(A) 1, 7
(B) , 4 4
3 7
Q.12 The function f(x) = sin x cos x
is -
, 5
12 ,
x tanx
(C)
3
(D) 7
(A) odd
(B) Even
Q.5 Solution of (x – 1)2 (x + 4) < 0 is-
(A) (–, 1) (B) (–, –4)
(C) (–1, 4) (D) (1, 4)
Q.6 Solution of (2x + 1) (x – 3) (x + 7) < 0 is-
(C) neither even nor odd
(D) odd and periodic
Q.13 A function is called even function if its graph is symmetrical w.r.t.-
(A) origin (B) x = 0
(C) y = 0 (D) line y = x
1 ,3
1 ,3
(A) (– , –7)
2
(B) (– , – 7)
Q.14 A function is called odd function if its graph is symmetrical w.r.t.-
(C) (–, 7) 1 ,3
2
(D) (–, –7) (3, )
(A) Origin (B) x = 0
(C) y = 0 (D) line y = x
Q.15 The even function is-
Q.7 If x2 + 6x – 27 > 0 and x2 – 3x – 4 < 0, then-
(A) x > 3 (B) x < 4
(A) f(x) = x2 (x2 +1) (B) f(x) = sin3 x + 2
(C) f(x) = x (x +1) (D) f(x) = tan x + c
(C) 3 < x < 4 (D) x = 7 2
Q.16 A function whose graph is symmetrical about the y-axis is given by-
Q.25 In the following which function is not periodic-
(A) f(x) = loge
(x + )
(A) tan 4x (B) cos 2x
(C) cos x2 (D) cos2x
(B) f(x + y) = f(x) + f(y) for all x, y R
(C) f(x) = cos x + sin x
(D) None of these
Q.17 Which of the following is an even function ?
ax 1
1
Q.26 Domain of the function f(x) = x 2
is-
(A) x
ax 1
(B) tan x
(A) R (B) (–2, )
(C) [2, ] (D) [0, ]
(C) (C)
ax ax (D)
2
ax 1
ax 1
Q.27 The domain where function f(x) = 2x2 – 1 and g(x) = 1 – 3x are equal, is-
Q.18 In the following, odd function is -
(A) cos x2 (B) (ex + 1)/(ex – 1)
(C) x2 – |x| (D) None of these
Q.19 The function f(x) = x2 – |x| is -
(A) an odd function
(B) a rational function
(C) an even func
Level # 1 51
Level # 2 30
Level # 3 24
Level # 4 12
Total no. of questions 117
LEVEL-1
Equation and properties of the ellipse
Q.1 The equation to the ellipse (referred to its axes as the axes of x and y respectively) whose foci are(± 2,0) and eccentricity1/2,is-
Q.9 The equation of the ellipse (referred to its axes as the axes of x and y respectively) which passes through the point (– 3, 1) and has eccentricity
2
5 , is-
(A) 3x2 + 6y2 = 33 (B) 5x2 + 3y2 = 48
x 2 y2
x 2 y2
(C) 3x2 + 5y2 –32 = 0 (D) None of these
(A) 12 16 = 1 (B) 16
x 2 y2
12 = 1
Q.10 Latus rectum of ellipse
4x2 + 9 y2 – 8x – 36 y + 4 = 0 is-
(C) 16 8 = 1 (D) None of these 5
Q.2 The eccentricity of the ellipse
(A) 8/3 (B) 4/3 (C) 3
(D) 16/3
9x2 + 5y2 – 30 y = 0 is-
(A) 1/3 (B) 2/3
(C) 3/4 (D) None of these
Q.3 If the latus rectum of an ellipse be equal to half of its minor axis, then its eccentricity is-
(A) 3/2 (B) 3 /2
(C) 2/3 (D) 2 /3
Q.4 If distance between the directrices be thrice the distance between the foci, then eccentricity of ellipse is-
(A) 1/2 (B) 2/3
Q.11 The latus rectum of an ellipse is 10 and the minor axis is equal to the distance between the foci. The equation of the ellipse is-
(A) x2 + 2y2 = 100 (B) x2 + 2 y2 =10
(C) x2 – 2y2 = 100 (D) None of these
Q.12 If the distance between the foci of an ellipse be equal to its minor axis, then its eccentricity is-
(A) 1/2 (B) 1/ (C) 1/3 (D) 1/
Q.13 The equation 2x2 + 3y2 = 30 represents-
(A) A circle (B) An ellipse
(C) 1/
(D) 4/5
(C) A hyperbola (D) A parabola
Q.5 The equation ax2 + 2hxy + by2 + 2gx + 2fy + c = 0 represents an ellipse if-
(A) = 0, h2 < ab (B) 0, h2 < ab
(C) 0, h2 > ab (D) 0, h2 = ab
Q.14 The equation of the ellipse whose centre is (2,– 3), one of the foci is (3,– 3) and the corresponding vertex is (4,– 3) is-
Q.6 Equation of the ellipse whose focus is (6,7) directrix is x + y + 2 = 0 and e = 1/ 3 is-
(A) 5x2 + 2xy + 5y2 – 76x – 88y + 506 = 0 (B) 5x2 – 2xy + 5y2 – 76x – 88y + 506 = 0 (C) 5x2 – 2xy + 5y2 + 76x + 88y – 506 = 0
(x 2)2
(A) 3
(x 2)2
(B)
4
(y 3)2
+ = 1
4
(y 3) 2
+ 3 = 1
(D) None of these
Q.7 The eccentricity of an ellipse
x2
a 2 +
y2
b2 = 1 whose
x 2
(C) 3
+ y = 1
4
latus rectum is half of its major axis is-
1
(D) None of these
Q.15 Eccentricity of the ellipse
(A) 2
(B)
4x2 +y2 – 8x + 2y+ 1= 0 is-
(C)
3 (D) None of these
2
(A) 1/ 3 (B) 3/2
(C) 1/2 (D) None of these
Q.8 The equation of the ellipse whose centre is at origin and which passes through the points (– 3,1) and (2,–2) is-
(A) 5x2 + 3y2 = 32 (B)3x2 + 5y2 = 32
(C) 5x2 – 3y2 = 32 (D) 3x2 + 5y2 + 32= 0
Q.16 The equation of ellipse whose distance between the foci is equal to 8 and distance between the directrix is 18, is-
(A) 5x2 – 9y2 = 180 (B) 9x2 + 5y2 = 180
(C) x2 + 9y2 =180 (D) 5x2 + 9y2 = 180
Workshop on IEEE vTools: Getting Involve with IEEE Volunteer ToolsInteX Research Lab
The session as titled Workshop on IEEE vTools was organized by IEEE Computer Society Bangladesh Chapter and hosted by University of Liberal Arts Bangladesh Student Branch. The aims of the training session was to train up the executive volunteers of several student branch and cs student chapter ExCom as that they can involve themselves with the IEEE Volunteer tools and utilize the IEEE resources.
Here try to sort out some key benefits and opportunities for the undergraduate and graduate students with their IEEE membership and volunteering supports.
It was prepared for the Seminar on Introduction to IEEE and It's opportunities organized by Computer and Programming Club - Daffodil International University PErmananet campus in collaboration with IEEE DIU Student Branch at 24th July 2018.
Pipelining is an speed up technique where multiple instructions are overlapped in execution on a processor. It is an important topic in Computer Architecture.
This slide try to relate the problem with real life scenario for easily understanding the concept and show the major inner mechanism.
Deadlock is a very important topic in operating system. In this presentation slide, try to relate deadlock with real life scenario and find out some solution with two main algorithm- Safety and Banker's Algorithm.
Synthetic Fiber Construction in lab .pptxPavel ( NSTU)
Synthetic fiber production is a fascinating and complex field that blends chemistry, engineering, and environmental science. By understanding these aspects, students can gain a comprehensive view of synthetic fiber production, its impact on society and the environment, and the potential for future innovations. Synthetic fibers play a crucial role in modern society, impacting various aspects of daily life, industry, and the environment. ynthetic fibers are integral to modern life, offering a range of benefits from cost-effectiveness and versatility to innovative applications and performance characteristics. While they pose environmental challenges, ongoing research and development aim to create more sustainable and eco-friendly alternatives. Understanding the importance of synthetic fibers helps in appreciating their role in the economy, industry, and daily life, while also emphasizing the need for sustainable practices and innovation.
How to Split Bills in the Odoo 17 POS ModuleCeline George
Bills have a main role in point of sale procedure. It will help to track sales, handling payments and giving receipts to customers. Bill splitting also has an important role in POS. For example, If some friends come together for dinner and if they want to divide the bill then it is possible by POS bill splitting. This slide will show how to split bills in odoo 17 POS.
Ethnobotany and Ethnopharmacology:
Ethnobotany in herbal drug evaluation,
Impact of Ethnobotany in traditional medicine,
New development in herbals,
Bio-prospecting tools for drug discovery,
Role of Ethnopharmacology in drug evaluation,
Reverse Pharmacology.
Unit 8 - Information and Communication Technology (Paper I).pdfThiyagu K
This slides describes the basic concepts of ICT, basics of Email, Emerging Technology and Digital Initiatives in Education. This presentations aligns with the UGC Paper I syllabus.
2024.06.01 Introducing a competency framework for languag learning materials ...Sandy Millin
http://sandymillin.wordpress.com/iateflwebinar2024
Published classroom materials form the basis of syllabuses, drive teacher professional development, and have a potentially huge influence on learners, teachers and education systems. All teachers also create their own materials, whether a few sentences on a blackboard, a highly-structured fully-realised online course, or anything in between. Despite this, the knowledge and skills needed to create effective language learning materials are rarely part of teacher training, and are mostly learnt by trial and error.
Knowledge and skills frameworks, generally called competency frameworks, for ELT teachers, trainers and managers have existed for a few years now. However, until I created one for my MA dissertation, there wasn’t one drawing together what we need to know and do to be able to effectively produce language learning materials.
This webinar will introduce you to my framework, highlighting the key competencies I identified from my research. It will also show how anybody involved in language teaching (any language, not just English!), teacher training, managing schools or developing language learning materials can benefit from using the framework.
How to Make a Field invisible in Odoo 17Celine George
It is possible to hide or invisible some fields in odoo. Commonly using “invisible” attribute in the field definition to invisible the fields. This slide will show how to make a field invisible in odoo 17.
3. Floyd Warshall Algorithm - what?
An example of dynamic programming
An algorithm for finding shortest paths in
a weighted graph with positive or negative
edge weights
no negative cycles
find the lengths of the shortest paths
between all pairs of vertices
4. History and naming - how?
Bernard Roy in 1959
Robert Floyd in 1962
Stephen Warshall in 1962
Peter Ingerman in 1962
5. The algorithm is also known as
History and naming - how?
The Floyd's algorithm
the Roy–Warshall algorithm
the Roy–Floyd algorithm, or
the WFI algorithm
The Floyd's algorithm
the Roy–Warshall algorithm
the Roy–Floyd algorithm, or
the WFI algorithm
6. Shortest paths – mean?
Path 1: A -> B -> D = 7
Path 2: A -> C -> D = 7
Path 3: A -> B -> C -> D = 6
There are several paths
between A and D:
5
4
312
7. There are several things to notice here:
There can be more then one route
between two nodes.
The number of nodes in the route isn’t
important (Path 3 has 4 nodes but is
shorter than Path 1 or 2, which
has 3 nodes).
There can be more than one path of
minimal length.
Shortest paths – mean?
8. Floyd Warshall Algorithm- programs
Distance Table
Sequence Table
Iteration is N-1
here, N= number of node
= 4
so, 4-1 = 3 iteration.
According to this algorithm, we need-
9. Distance Table by D0, D1, D2, ……. ,Dn
Sequence Table by S0, S1, S2,……. ,Sn
Iteration by K
Here we denoted-
Floyd Warshall Algorithm- programs
10. D0 A B C D
A - 2 4
B 2 - 1 5
C 4 1 - 3
D 5 3 -
S0 A B C D
A - 2 3 4
B 1 - 3 4
C 1 2 - 4
D 1 2 3 -
Iteration = 0 K = 0
All Diagonal = null
Floyd Warshall Algorithm- programs
11. D1 A B C D
A - 2 4
B 2 - 1 5
C 4 1 - 3
D 5 3 -
S1 A B C D
A - 2 3 4
B 1 - 3 4
C 1 2 - 4
D 1 2 3 -
1st row unchanged
1st Colum unchanged
Iteration = 1 K = 1
if (dij > dik + dkj )
D1(ij) = dik+dkj
else D1(ij) = dij
Floyd Warshall Algorithm- programs
12. D2 A B C D
A - 2 3
B 2 - 1 5
C 3 1 - 3
D 5 3 -
S2 A B C D
A - 2 2 4
B 1 - 3 4
C 2 2 - 4
D 1 2 3 -
Iteration = 2 K = 2
2nd row unchanged
2nd Colum unchanged
if (dij > dik + dkj )
D1(ij) = dik+dkj
else D1(ij) = dij
Floyd Warshall Algorithm- programs
13. D3 A B C D
A - 2 3 6
B 2 - 1 4
C 3 1 - 3
D 6 4 3 -
S3 A B C D
A - 2 2 3
B 1 - 3 3
C 2 2 - 4
D 3 3 3 -
Iteration = 3 K = 3
3rd row unchanged
3rd Colum unchanged
if (dij > dik + dkj )
D1(ij) = dik+dkj
else D1(ij) = dij
Floyd Warshall Algorithm- programs
14. Shortest Path
A B C D
A - 2 3 6
B 2 - 1 4
C 3 1 - 3
D 6 4 3 -
A B C D
A - 2 2 3
B 1 - 3 3
C 2 2 - 4
D 3 3 3 -
A >> C i=1, j=3
Distance: d13 = 3
Path: S13 = 2 A >> B >> C
S12 = 2 A >> B >> C
2+1 = 3
15. A B C D
A - 2 3 6
B 2 - 1 4
C 3 1 - 3
D 6 4 3 -
A B C D
A - 2 2 3
B 1 - 3 3
C 2 2 - 4
D 3 3 3 -
A >> D i=1, j=4
Distance: d14 = 6
Path: S14 = 3 A >> C >> D
S13 = 2 A >> B >> C >> D
S12 = 2 A >> B >> C >> D
Shortest Path
16. The running time is O(n3
).
The space
requirements
are O(n2
)
16
Time and Space Requirements
17. Shortest paths in directed graphs
Transitive closure of directed
graphs.
Inversion of real matrices
Optimal routing.
Maximum bandwidth paths
Computing canonical form of
difference bound matrices
Applications and generalizations
The Floyd–Warshall algorithm is an example of dynamic programming. In computer science, the Floyd–Warshall algorithm is an algorithm for finding shortest paths in a weighted graph with positive or negative edge weights (but with no negative cycles). A single execution of the algorithm will find the lengths of the shortest paths between all pairs of vertices, though it does not return details of the paths themselves.
The Floyd–Warshall algorithm was published by Bernard Roy in 1959. Later it recognized form by Robert Floyd in 1962 and also by Stephen Warshall in 1962 for finding the transitive closure of a graph. The modern formulation of the algorithm as three nested for-loops was first described by Peter Ingerman, in 1962.
The algorithm is also known as Floyd&apos;s algorithm, the Roy–Warshall algorithm, the Roy–Floyd algorithm, or the WFI algorithm.
The shortest path between two nodes of a graph is a sequence of connected nodes so that the sum of the edges that inter-connect them is minimal.
the space requirements are high. One can reduce the space from O(n3) to O(n2) by using a single array d.
Let n be |V|, the number of vertices. To find all n2 of shortestPath(i,j,k) (for all i and j) from those of shortestPath(i,j,k−1) requires 2n2 operations. Since we begin with shortestPath(i,j,0) = edgeCost(i,j) and compute the sequence of n matrices shortestPath(i,j,1), shortestPath(i,j,2), …, shortestPath(i,j,n), the total number of operations used is n · 2n2 = 2n3. Therefore, the complexity of the algorithm is Θ(n3).
The Floyd–Warshall algorithm can be used to solve the following problems, among others:
In mathematics, the transitive closure of a binary relation R on a set X is the transitive relation R+ on set X such that R+ contains R and R+ is minimal