29 août 20193 août 2020 Bastien Pasdeloup Routing helps us... navigate between any two vertices in a graph. determine if there are any cycles in the spanning tree of a graph. calculate the order of the graph. In a rooted tree... every vertex except the root has a unique parent. all children have cousins. every vertex has a unique child. In a routing table, we can find... the weights of the edges between two vertices of a graph. the parents of the vertices in a rooted spanning tree of a graph. the children of the vertices in a rooted spanning tree of a graph. Time is Up!
