Interface Graph

    • Method Detail

      • schema

        org.neo4j.gds.api.schema.GraphSchema schema()
      • isEmpty

        default boolean isEmpty()
      • relationshipCount

        long relationshipCount()
        Returns:
        returns the total number of relationships in the graph.
      • release

        default void release()
        Release all resources which are not part of the result or IdMap
      • releaseTopology

        default void releaseTopology()
        Release only the topological data associated with that graph.
      • releaseProperties

        default void releaseProperties()
        Release only the properties associated with that graph.
      • isMultiGraph

        boolean isMultiGraph()
        Whether the graph is guaranteed to have no parallel relationships. If this returns false it still may be parallel-free, but we do not know.
        Returns:
        true iff the graph has maximum one relationship between each pair of nodes.
      • relationshipTypeFilteredGraph

        Graph relationshipTypeFilteredGraph​(java.util.Set<org.neo4j.gds.RelationshipType> relationshipTypes)
      • hasRelationshipProperty

        boolean hasRelationshipProperty()
      • canRelease

        void canRelease​(boolean canRelease)
      • concurrentCopy

        Graph concurrentCopy()
        Specified by:
        concurrentCopy in interface RelationshipIterator
        Returns:
        a copy of this iterator that reuses new cursors internally, so that iterations happen independent from other iterations.
      • asNodeFilteredGraph

        java.util.Optional<NodeFilteredGraph> asNodeFilteredGraph()
        If this graph is created using a node label filter, this will return a NodeFilteredGraph that represents the node set used in this graph. Be aware that it is not guaranteed to contain all relationships of the graph. Otherwise, it will return an empty Optional.