D120.de/forum

Code: Alles auswählen

public void doFunctionality()
{
    Node<N,E> currentNode = getCurrentNode();
    
    if(currentNode == null || currentNode == getTargetNode()) setPathFound(true);
    else
    {
        getClosedList().add(currentNode);
        expandNode(currentNode);
    }
}

Code: Alles auswählen

private void expandNode(Node<N, E> node)
{
    if(node == null) return;
    
    AbstractEdgeComparator<E> comp = getComparator();
    
    PriorityQueue<Node<N, E>> openList = getOpenList();
    Node<N,E> targetNode;
    for(Edge<N,E> edge : node.getFanOut())
    {
        targetNode = edge.getTargetNode();
        openList.offer(targetNode);
        if(sourceDistanceMap.get(targetNode) == null)
        {
            sourceDistanceMap.put(targetNode,comp.sum(sourceDistanceMap.get(node),edge.getData()));
            predecessorMap.put(targetNode,node);
        }
        else
        {
            if(comp.compare(sourceDistanceMap.get(targetNode),comp.sum(sourceDistanceMap.get(node),edge.getData())) > 0)
            {
                sourceDistanceMap.put(targetNode,comp.sum(sourceDistanceMap.get(node),edge.getData()));
                predecessorMap.put(targetNode,node);
            }
        }
        
    }
}

Code: Alles auswählen

Antwort des Servers
Junitreport

    Time – 259

    Testcount – 5

    Failurecount – 2

    Ignorerecount – 0

Failurereport

    Testheadder – staticFunctionTest(graph.algorithm.astar.AStarFunctionalityTest)

    Message –

    Trace

Failurereport

    Testheadder – dynamicFunctionTestNotConnected(graph.algorithm.astar.AStarFunctionalityTest)

    Message –

    Trace