List and drop graphs

Now that you've practiced creating various types of projectionsAn in-memory copy of part of your database that graph algorithms run against. You choose which nodes and relationships it holds.—monopartiteA graph in which every node is the same kind of thing, so relationships connect like to like., bipartiteA graph with two kinds of node, where every relationship joins one kind to the other and never two of the same kind., and multipartiteA graph with three or more kinds of node, where relationships only ever join nodes of different kinds.—it's time to learn how to manage them efficiently.

Throughout this course, you've been creating graph projections using gds.graph.project(). Each projection gets stored in GDSAnalysing data through the structure of its connections. Also the name of the Neo4j library that implements it.'s graph catalogThe set of projections currently held in memory, each listed and dropped by name.—an in-memory store of all your projected graphs.