Dynamic representation of a graph

This article seems to be interested in the dynamic representation of a graph , during the execution of a program. The graph is represented in the form of a chained list of tops.

For each top, one with the list of the predecessors of the top, the list of the successors of the top and various useful informations (here entirety, but that depends on the desired implementation).

standard t_listsom = ↑s_som /* list of the tops * t_listadj = ↑s_ladj /* list of adjacency * s_som = recording /* a top * entirety som t_listadj succ t_listadj pred t_listsom suiv fine recording s_som s_ladj = recording /* a successor (or predecessor) * t_listsom vsom entirety nbliens t_cout cost t_listadj suiv fine recording s_ladj t_graphe_d = recording /* the graph * entirety order the Boolean East t_listsom lsom fine recording t_graphe_d

Here representations of the two subgraphs resulting from S'= {1, 2,3,4} and of S'= {1, 2,4,5,7}:

to see too

Random links:Stables of Formula 1 | Sphaenophyta (phylogenetic classification) | Jagged Alliance 2 | Vlastimir | Grabovo (Ražanj) | Contusion