1: | What is the basic application of the SPF algorithm? |

A1:
| The SPF algorithm was designed to find the shortest distance between two points in any problem that can be modeled as a graph. |

2: | What is a directed graph, and how is an internetwork modeled as a directed graph? |

A2:
| A directed graph or digraph consists of the set of vertices and the set of interconnections between the vertices referred to as arcs or directed edges. An internetwork is modeled as a directed graph by representing the network nodes or routers as vertices and the network links (adjacencies) as arcs. Bidirectional traffic flow is depicted by parallel opposite arrows. |

3: | Name the three lists used in the operation of the Dijkstra algorithm for computing IS-IS routes. |

A3: ... |

Start Free Trial

No credit card required