Interface TypedGraph

  • All Known Implementing Classes:
    BVImmutableTypedGraph

    public interface TypedGraph
    A graph with typed nodes. Every node in a typed graph is identified by a long in which the upper bits store the type (at most 248 types are allowed) and the lower bits store the id within the type (at most 248 ids are allowed). The methods node(int, long), type(long) and id(long) make conversions easy.
    • Method Detail

      • numNodes

        long numNodes()
      • numNodes

        long numNodes​(int type)
      • numArcs

        long numArcs()
      • outdegree

        long outdegree​(long node)
                throws java.io.IOException
        Throws:
        java.io.IOException
      • successors

        LazyLongIterator successors​(long node)
                             throws java.io.IOException
        Throws:
        java.io.IOException
      • type

        static int type​(long node)
      • id

        static long id​(long node)
      • node

        static long node​(int type,
                         long id)