def get_remaining_graph(self) -> BELGraph:
return self.graph.subgraph(self.unscored_nodes_iter())<EOL>
Allows for introspection on the algorithm at a given point by returning the sub-graph induced
        by all unscored nodes

        :return: The remaining un-scored BEL graph