Esempi in C# (CSharp) per Data_Structures.Undirected_Graph NodeEntry

Esempio n. 1

File: CustomPriorityQueueForDjikshra.cs Progetto: shubhamrawool/Algorithms-And-Data-Structures

        public void Push(NodeEntry node)
        {
            var existingNode = nodeList.Find(x => x.Node.Label == node.Node.Label);

            if (existingNode != null)
            {
                existingNode.Priority = node.Priority;
            }
            else
            {
                Count++;
                nodeList.Add(node);
            }

            nodeList = nodeList.OrderBy(x => x.Priority).ToList();
        }

Esempio n. 2

File: CustomPriorityQueueForDjikshra.cs Progetto: shubhamrawool/Algorithms-And-Data-Structures

 private void Remove(NodeEntry node)
 {
     Count--;
     nodeList.Remove(node);
 }