Bellman Ford Algorithm

  A control valve , also known as a Final Control Element , is a valve that controls fluid flow by changing the size of the flow passage in response to a controller signal. This allows for direct control of flow rate and, as a result, process variables like pressure, temperature, and liquid level.   The question here is why these control valves are needed? Process plants are made up of thousands of control loops that are all interconnected just to create a product that can be sold. Each of these control loops is aimed at keeping process variables like pressure, flow, etc within a specified operating range in order to ensure the end product's quality. Each of these loops creates disturbances that have a negative impact on the process variable, and connections with other loops in the network generate disturbances that have an effect on the process variable. Sensors and transmitters gather information about the process variable and its connection to some desired set point to redu...

IoT Architecture The Internet of Things, or IoT. We all have heard about it. But what is it, and why is it so promising such a vast change in the world? Smart cars, smart homes everything around us can be turned into smart devices with the help of IoT.  What is IoT? "The Internet of Things (IoT) is a system of interrelated computing devices, mechanical or digital machines, objects, animals or people that are provided with unique identifiers and the ability to transfer data over a network without requiring human-to-human or human-to-computer interaction".       It's kind of messed up isn't it? In simple language it is a network of devices which can sense, accumulate, and transfer data over the internet without any human interaction. Evolution of IoT: The Pre-Internet era  In Pre-Internet era there was human-to-human communication or through telephone.   The Dawn of Internet The whole world changed with the origin of Internet. We could share information ...

 Introduction: Graph is a non-linear data structure which consists of nodes and edges.  Graphs are used to find 'Shortest Path' if possible. Basically the very popular example for graphs is Google Maps as gives you different path suggestions to reach your destination.    What do you mean by shortest path? "A path with minimum cost or distance between two vertices is called Shortest Path".  There are many algorithms for finding the shortest paths in a weighted graphs as listed below:  Dijkstra’s Algorithm   Bellman Ford Algorithm   Floyd’s Algorithm Let's take a look at Bellman Ford Algorithm. Bellman Ford Algorithm: Imagine a scenario where you need to get to a baseball game from your house. Along the way, on each road, one of two things can happen. First, sometimes the road you're using is a toll road, and you have to pay a certain amount of money. Second, sometimes someone you know lives on that street (like a family member or a friend...