Class SrlgGraphSearch<V extends Vertex,​E extends Edge<V>>

  • All Implemented Interfaces:
    GraphPathSearch<V,​E>

    public class SrlgGraphSearch<V extends Vertex,​E extends Edge<V>>
    extends AbstractGraphPathSearch<V,​E>
    SRLG Graph Search finds a pair of paths with disjoint risk groups; i.e if one path goes through an edge in risk group 1, the other path will go through no edges in risk group 1.
    • Constructor Detail

      • SrlgGraphSearch

        public SrlgGraphSearch​(int groups,
                               java.util.Map<E,​java.lang.Integer> grouping)
        Creates an SRLG graph search object with the given number of groups and given risk mapping.
        Parameters:
        groups - the number of disjoint risk groups
        grouping - map linking edges to integral group assignments
      • SrlgGraphSearch

        public SrlgGraphSearch​(java.util.Map<E,​java.lang.Object> grouping)
        Creates an SRLG graph search object from a map, inferring the number of groups and creating an integral mapping.
        Parameters:
        grouping - map linking edges to object group assignments, with same-group status linked to equality