CHAPTER 25 Weighted Graphs and Applications Objectives • To ...

Recall that we created a class NineTailModel in Section 24.8 for modeling the nine tail problem. We
now create a new class named WeightedNineTailModel that extends NineTailModel, as shown
in Figure 25.22.
NineTailModel
#tree: Tree*
+NineTailMod el()
+get Shortes tPath(nodeIndex: i nt):
vector
+getNode(index: int): vector
+getIndex(node: vector&): int
+printNode(node: vector&): void
#getEdges(): vector
#getFlippedNode(nod e: vector&,
position: int): int
#flipACell(&node: vector&, row:
int, column: int): void
A tree rooted at node 511.
Constructs a model for th e Nine Tail problem and obtains
th e tree.
Returns a path from the specified n ode to the root. The
path returned consists of the node labels in a vector.
Returns a node consists of nine characters of H’s and T’s.
Returns the index of the specified node.
Displays the node to the console.
Returns a vector of Edge objects for the graph.
Flip the node at the specified position and returns the
index of the flipped node.
Flips th e node at th e specified row and colu mn.
WeightedNineTailModel
+Wei ghted Ni neTai lModel()
+getNumberOfFlips(u: int): int
-getNumberOfFlips(u: int, v: int): int
-getEdges(): vector
Constructs a model for the weighted nine tail problem
and obtains a ShortestPathTree rooted from the target
node.
Returns the number of flips from node u to the target
node 511.
Ret urns the number of di fferen t cells between the two
nodes.
Gets the weigh ted edges for the weighted nine tail
problem.
Figure 25.22
WeightedNineTailModel extends NineTailModel.
The NineTailModel class creates a Graph and obtains a Tree rooted at the target node 511.
WeightedNineTailModel is the same as NineTailModel except that it creates a
WeightedGraph and obtains a ShortestPathTree rooted at the target node 511. The functions
getShortestPath(int),
getNode(int), getIndex(node), getFlippedNode(node, position),
40