Which algorithm does IS-IS use to determine the shortest path through a network?

Which algorithm does IS-IS use to determine the shortest path through a network?
A. Bellman-Ford routing algorithm
B. Johnson’s algorithm
C. Dijkstra’s algorithm
D. Floyd-Warshall algorithm

cisco-exams

Leave a Reply

Your email address will not be published. Required fields are marked *


The reCAPTCHA verification period has expired. Please reload the page.