/
Queue.cs
86 lines (78 loc) · 2.38 KB
/
Queue.cs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
using System;
using System.Collections.Generic;
using System.Linq;
using System.Web;
namespace AStarWebApplication
{
public class Queue
{
public List<LocationInfo> genericQueue;
//constructor
public Queue()
{
genericQueue = new List<LocationInfo>();
}
// Method that returns the number of elements in the queue
public int queueLength
{
get
{
return genericQueue.Count;
}
}
// Method to dequeue and return the first element in the queue
public LocationInfo deQueue()
{
LocationInfo location = genericQueue[0];
genericQueue.RemoveAt(0);
return location;
}
// Method to add an item to the list
public void enQueue(LocationInfo location)
{
bool present = false;
for (int i = 0; i < genericQueue.Count; i++)
{
LocationInfo placeHolder = genericQueue[i];
if (placeHolder._costOfTraversal.getCostOfTraversal() >= location._costOfTraversal.getCostOfTraversal())
{
genericQueue.Insert(i, location);
present = true;
break;
}
}
if (!present)
{
genericQueue.Add(location);
}
}
public void enQueueFewerLinks(LocationInfo location)
{
bool present = false;
for (int i = 0; i < genericQueue.Count; i++)
{
LocationInfo placeHolder = genericQueue[i];
if (placeHolder._costOfTraversal.getCostOfTraversal() >= location._costOfTraversal.getCostOfTraversal())
{
genericQueue.Insert(i, location);
present = true;
break;
}
}
if (!present)
{
genericQueue.Add(location);
}
}
// Method to check whether an element is present in the queue or not
public bool exists(LocationInfo node)
{
return genericQueue.Contains(node);
}
// Method to remove an item from the priority queue
public void remove(LocationInfo node)
{
genericQueue.Remove(node);
}
}
}