hasibul-hasan-shuvo

for(int adjacentNode = 0; adjacentNode < nodeNumber; adjacentNode++){
      if(!visitedNode[adjacentNode] &&
                 graph[minNode][adjacentNode] != INT_MAX &&
                 visitedCost[minNode] != INT_MAX &&
                visitedCost[minNode] + graph[minNode][adjacentNode] < visitedCost[adjacentNode])
          visitedCost[adjacentNode] = visitedCost[minNode] + graph[minNode][adjacentNode];
}

hasibul-hasan-shuvo

for(int node = 0; node < nodeNumber; node++){
      if(!visitedNode[node] && visitedCost[node] < minCostedNode){
          minNode = node;
          minCostedNode = visitedCost[node];
       }
}