reverse engineering – recent advances and applications - OpenLibra

GUIsurfer: A Reverse Engineering Framework for User Interface Software
GUIsurfer: A Reverse Engineering Framework for User Interface Software 11
Now, for brevity, the graph described in Figure 3 will be considered. All vertices and edges
Fig. 3. Agenda’s behaviour graph (numbered)
are labeled with unique identifiers.
To illustrate the analysis performed with Graph-Tool, three metrics will be considered: Shortest
distance between vertices, Pagerank and Betweenness.
4.1.0.1 Shortest Distance
Graph-Tool enables the calculation of the shortest path between two vertices. A path is a
sequence of edges in a graph such that the target vertex of each edge is the source vertex
of the next edge in the sequence. If there is a path starting at vertex u and ending at vertex v
then v is reachable from u.
For example, the following Python command calculate the shortest path between vertices 11
and 6 (i.e. between the Login window and a particular ContactEditor window state), cf. Figure
3.
vlist, elist = shortest_path(g, g.vertex(11), g.vertex(6))
print "shortest path vertices", [str(v) for v in vlist]
print "shortest path edges", [str(e) for e in elist]
41