Skip to content

Latest commit

 

History

History
5 lines (4 loc) · 318 Bytes

README.md

File metadata and controls

5 lines (4 loc) · 318 Bytes

krssg_task1

FSM

This is making use of the finite state machines and there are three states - UP , DOWN , HALT and using recursive calls within each state to call the other states this is compiled in python and two objects are made to check the shortest path in every possible path i.e , initially either up or down