Esempio n. 1
0
        private void DijkstraAlgorithm(List<Edge>[] graph, Node startNode, Node endNode)
        {
            PriorityQueue<Node> queue = new PriorityQueue<Node>();
            startNode.ReliabilityFrmSource = 0.0m;
            queue.Enqueue(startNode);

            while (true)
            {
                Node currentNode = queue.Dequeue();
                for (int i = 0; i < graph[currentNode.Id].Count; i++)
                {
                    graph[currentNode.Id][i];
                }
            }
        }
Esempio n. 2
0
 public Edge(Node endNode)
 {
     this.EndNode = endNode;
 }