Definitions

graph

A graph is a set of vertices together with their edge relationships.

vertex

A vertex is a node in a graph that can serve as an endpoint for edges.

edge

An edge is a link with two vertex endpoints. An edge can be undirected or directed.

path

A path is a sequence of edges from the source vertex to the destination vertex, represented as a PrgT_Vector of edges. In a path, no vertex or edge is repeated.

route

A route is another term for a path.

hop

A hop is one directed step in a path from a vertex through an edge to another vertex. The hop length of a path is the number of edges in the path. A one-hop path is a PrgT_Vector containing one edge.

vertex-disjoint

Two paths are vertex-disjoint if they are between the same source and destination and they do not share any common vertices or edges except for the source and destination.

edge-disjoint

Two paths are edge-disjoint if they are between the same source and destination and they do not share any common edges.

shortest-path

A shortest-path is a path whose total length is not longer than any other path with the same source and destination. Note that a (source,destination) pair might have several equal-cost shortest-paths. The length (cost) of the path is the sum of the edge weights in the path.

cycle

In this API, a cycle is a pair of paths that share the same source and destination (the two halves of a traditional cycle). A cycle is represented by a length–2 PrgT_Vector of paths. Each of these is a path as defined above, but the two paths in general can have arbitrary specified relationship (not necessary vertex-disjoint).

shortest-cycle, shortest-pair

A shortest-cycle (or shortest-pair) is a cycle (pair of paths) of shortest total length that meets or best approximates a specified constraint (vertex-disjointness or edge-disjointness).

predecessor list

A vertex's predecessor list stores the set of edges in the shortest path tree from the source vertex. If there is only one shortest path from the source vertex to a destination vertex, there will only be one entry in the list. Complete paths may be constructed from predecessor information by following the predecessor information from the destination back to the source. In this API, predecessor information is used to store the shortest path tree from one source vertex.

routing table

A vertex’s routing table is an efficient data structure for storing the set of next-hops edges from the vertex to any destination vertex. Each next-hop edge is the first hop in a shortest path from the vertex to the destination. In order to construct complete paths using routing tables, each vertex in the path must have a routing table defined.

本站文档由 北京智网畅联科技有限公司 整理、翻译并提供 · Documentation compiled and provided by Beijing ZNetLink Technology Co., Ltd.

交流群 · QQ Group:OPNET/智网妙算网络仿真交流群(群号 486383494)

原文档 © 2017 Riverbed Technology · 本站为公益翻译,由 AI 辅助完成,请仔细甄别

Original documentation © 2017 Riverbed Technology. Community translation, AI-assisted. Contact: jiazequn@znetlink.com