feat: bfs algo shortest path

[monotykamary]

What does this PR do?:

• Implements a ring-buffer queue for BFS
• Move Floyd Warshall files and reformat
• Rework shortest paths with nested ring-buffer BFS

Target Shortest Paths:

ROOT IDLE:

map[
	Booked:[
		{Reserved Book}
		{Idle Reserve}
	]
	Cancelled:[
		{Reserved Cancel}
		{Idle Reserve}
	]
	CheckedIn:[
		{Booked CheckIn}
		{Reserved Book}
		{Idle Reserve}
	]
	CheckedOut:[
		{CheckedIn CheckOut}
		{Booked CheckIn}
		{Reserved Book}
		{Idle Reserve}
	]
	Idle:[]
	Reserved:[
		{Idle Reserve}
	]
]

ROOT RESERVED:

map[
	Booked:[
		{Reserved Book}
	]
	
	Cancelled:[
		{Reserved Cancel}
	]

	CheckedIn:[
		{Booked CheckIn}
		{Reserved Book}
	]

	CheckedOut:[
		{CheckedIn CheckOut}
		{Booked CheckIn}
		{Reserved Book}
	]

	Reserved:[]
]