QuestionQ26Verified/IS-ISCopy linkReport a problemAsk AstroTutorSave questionWhich statement is accurate about IS-IS when it runs the Dijkstra algorithm?AThe local router moves its own local tuples into the candidate database.BWhen a new neighbor ID in the tree database matches a router ID in the LSDthe neighbor ID is moved to the candidate database.CTuples with the lowest cost are moved from the tree database to the LSDB.DThe algorithm will stop processing once the tree database is empty.Show AnswerAnswerExplanationIS-IS SPF adds the local router to the shortest-path tree, consults the link-state database for the LSP of each newly added router, and places its eligible neighbors into the candidate set. The algorithm selects the lowest-cost candidate for addition to the tree and terminates when no candidates remain.Show comments8Show commentsCommunity DiscussionNo comments yet. Be the first to start the discussion!
Community Discussion