KezvhLib/src-junit/net/kezvh/collections/graphs/directed/GraphWithEdgeValuesTemplate.java

   1 /**
   2  *
   3  */
   4 package net.kezvh.collections.graphs.directed;
   5
   6 import java.util.ArrayList;
   7 import java.util.Arrays;
   8 import java.util.Collections;
   9 import java.util.List;
  10
  11 import net.kezvh.collections.CollectionsUtilities;
  12 import net.kezvh.collections.DualMap.DualMap;
  13 import net.kezvh.collections.DualMap.HashDualMap;
  14 import net.kezvh.functional.Operations;
  15
  16 /**
  17  * @author mjacob
  18  */
  19 public enum GraphWithEdgeValuesTemplate {
  20         /**
  21          * nodes: []
  22          * edges: []
  23          */
  24         EMPTY(new ArrayList<Integer>(), new HashDualMap<Integer, Integer, Integer>()),
  25         /**
  26          * nodes: [0..15]
  27          * edges: all on [0..7], all on [8..15] (weight 1)
  28          */
  29         DISCONECTED(CollectionsUtilities.range(0, 16, Operations.INTEGER_INCREMENTER), new HashDualMap<Integer, Integer, Integer>() {
  30                 {
  31                         for (int i = 0; i < 8; i++)
  32                                 for (int j = 0; j < 8; j++)
  33                                         this.put(i, j, 1);
  34
  35                         for (int i = 8; i < 16; i++)
  36                                 for (int j = 8; j < 16; j++)
  37                                         this.put(i, j, 1);
  38                 }
  39         }),
  40         /**
  41          * nodes: [0..15]
  42          * edges: all (weight 1)
  43          */
  44         COMPLETE(CollectionsUtilities.range(0, 16, Operations.INTEGER_INCREMENTER), new HashDualMap<Integer, Integer, Integer>() {
  45                 {
  46                         for (int i = 0; i < 16; i++)
  47                                 for (int j = 0; j < 16; j++)
  48                                         if (i != j)
  49                                                 this.put(i, j, 1);
  50                 }
  51         }),
  52         /**
  53          * nodes: [0..99]
  54          * edges: [i => (i + 1) % 100] (weight 1)
  55          */
  56         CIRCULAR(CollectionsUtilities.range(0, 100, Operations.INTEGER_INCREMENTER), new HashDualMap<Integer, Integer, Integer>() {
  57                 {
  58                         for (int i = 0; i < 100; i++)
  59                                 this.put(i, (i + 1) % 100, 1);
  60                 }
  61         }),
  62         /**
  63          * nodes: [0..99]
  64          * edges: [i => i + 1] (weight 1)
  65          */
  66         LINEAR(CollectionsUtilities.range(0, 100, Operations.INTEGER_INCREMENTER), new HashDualMap<Integer, Integer, Integer>() {
  67                 {
  68                         for (int i = 0; i < 99; i++)
  69                                 this.put(i, i + 1, 1);
  70                 }
  71         }),
  72         /**
  73          * nodes: [1,2]
  74          * edges: [1 => 2] (weight 1)
  75          */
  76         SIMPLE(Arrays.asList(1, 2), new HashDualMap<Integer, Integer, Integer>() {
  77                 {
  78                         this.put(1, 2, 1);
  79                 }
  80         }),
  81         /**
  82          * nodes: [1]
  83          * edges: []
  84          */
  85         TRIVIAL(Collections.singletonList(1), new HashDualMap<Integer, Integer, Integer>()), ;
  86         private final List<Integer> nodes;
  87         private final HashDualMap<Integer, Integer, Integer> edges;
  88
  89         GraphWithEdgeValuesTemplate(final List<Integer> nodes, final HashDualMap<Integer, Integer, Integer> edges) {
  90                 this.nodes = nodes;
  91                 this.edges = edges;
  92         }
  93
  94         List<Integer> getNodes() {
  95                 return this.nodes;
  96         }
  97
  98         DualMap<Integer, Integer, Integer> getEdges() {
  99                 return this.edges;
 100         }
 101 }