Graphs as ADTs

• Operations:

  • Create empty graph
  • Determine if graph is empty
  • Determine number of vertices
  • Determine number of edges
  • Determine whether an edge exists between two vertices; return weighted value
  • Insert a new, unique vertex in the graph
  • Delete a particular vertex from a graph and any edges between the deleted vertex and any other vertex.
  • Insert a new, unique edge between two vertices
  • Delete an edge from the graph
  • Retrieve a vertex from the graph.