doc/solverstates.dot

   1 digraph solver_states {
   2
   3   size="8,5";
   4
   5   graph [fontsize=14];
   6   edge [fontsize=12];
   7   node [fontsize=12];
   8   node [shape=doublecircle]; Installed Uninstalled;
   9   node [shape=circle]; Satisfied Incomplete;
  10   node [shape=box];
  11 //  ranksep = 1.5;
  12 //  rankdir = LR;
  13 //  nodesep = 0.5;
  14   edge [style="setlinewidth(1)"];
  15
  16   Installed [label="Installed"];
  17   Uninstalled [label="Uninstalled"];
  18   Satisfied [label="Satisfied"];
  19   Incomplete [label="Incomplete"];
  20
  21   Uninstalled -> To_be_installed [ label ="install,explicit"];
  22   Uninstalled -> To_be_installed [ label ="install,implicit"];
  23   Installed -> To_be_removed [ label ="remove,explicit"];
  24   Installed -> To_be_removed [ label ="remove,implicit"];
  25   To_be_installed -> Installed [ label ="commit"];
  26   To_be_removed -> Uninstalled [ label ="commit"];
  27
  28   Uninstalled -> Satisfied [ label="establish,good" ];
  29   Uninstalled -> Incomplete [ label="establish,bad" ];
  30
  31   Installed -> Incomplete [ label="establish,bad" ];
  32
  33   Incomplete -> To_be_installed [ label="resolve" ];
  34   Incomplete -> To_be_removed [ label="remove" ];
  35
  36   Satisfied -> Installed [ label="install" ];
  37 }