Interface KPartiteGraph<V,​E>

  • All Superinterfaces:
    Graph<V,​E>, Hypergraph<V,​E>

    public interface KPartiteGraph<V,​E>
    extends Graph<V,​E>
    An interface for graphs whose vertices are each members of one of 2 or more disjoint sets (partitions), and whose edges connect only vertices in distinct partitions.
    • Method Detail

      • getVertices

        java.util.Collection<V> getVertices​(com.google.common.base.Predicate<V> partition)
        Returns all vertices which satisfy the specified partition predicate.
        Parameters:
        partition - Predicate which defines a partition
        Returns:
        all vertices satisfying partition
      • getPartitions

        java.util.Collection<com.google.common.base.Predicate<V>> getPartitions()
        Returns the set of Predicate instances which define this graph's partitions.
        Returns:
        the set of Predicate instances which define this graph's partitions