CB100

Notas, resueltos y tps de la materia Algoritmos y Estructuras de Datos
Index Commits Files Refs README
notas/arbol/img/src/nodo_arbol_b+.gv (1538B)
   1 // compile with dot
   2 
   3 graph Tree {
   4     rankdir=TB;
   5     node [shape=record, fontname="sans"];
   6     splines=polyline;
   7 
   8     R [label=<
   9         <table border="0" cellborder="1" cellspacing="0" cellpadding="6">
  10         <tr>
  11         <td port="left">*</td>
  12         <td>k1</td>
  13         <td port="middle">*</td>
  14         <td>k2</td>
  15         <td port="right">*</td>
  16         </tr>
  17         </table>
  18         >, shape=none];
  19 
  20     A [label=<
  21         <table border="0" cellborder="1" cellspacing="0" cellpadding="6">
  22         <tr>
  23         <td port="left">*</td>
  24         <td>k1</td>
  25         <td port="middle">*</td>
  26         <td>k3</td>
  27         <td port="right">*</td>
  28         </tr>
  29         </table>
  30         >, shape=none];
  31 
  32     B [label=<
  33         <table border="0" cellborder="1" cellspacing="0" cellpadding="6">
  34         <tr>
  35         <td port="left">*</td>
  36         <td>k2</td>
  37         <td port="middle">*</td>
  38         <td>k4</td>
  39         <td port="right">*</td>
  40         </tr>
  41         </table>
  42         >, shape=none];
  43 
  44     C [label=<
  45         <table border="0" cellborder="1" cellspacing="0" cellpadding="6">
  46         <tr>
  47         <td port="left">*</td>
  48         <td>k5</td>
  49         <td port="middle">*</td>
  50         <td>k6</td>
  51         <td port="right">*</td>
  52         </tr>
  53         </table>
  54         >, shape=none];
  55 
  56     R:left -- A:middle;
  57     R:middle -- B:middle;
  58     R:right -- C:middle;
  59 
  60     A:right -- B:left [dir=forward, arrowhead=normal, arrowsize=0.8];
  61     B:right -- C:left [dir=forward, arrowhead=normal, arrowsize=0.8];
  62 
  63     { rank=same; A; B; C; }
  64 }