• nodeCount() → $\Theta(1)$
• edgeCount() → $\Theta(n^2)$
• clear() → $\Theta(1)$
• isDirected() → $\Theta(1)$
• getNodes() → $\Theta(1)$
• addNode(GraphNode<L> node) → $\Theta(n)$
• removeNode(GraphNode<L> node) → $\Theta(n)$
• containsNode(GraphNode<L> node) → $\Theta(1)$
• getNodeOf(L label) → $O(n)$
• getNodeIndexOf(L label) → $\Theta(n)$
• getNodeAtIndex(int i) → $O(n)$
• getAdjacentNodesOf(GraphNode<L> node) → $O(n)$
• getEdges() → $\Theta(n^2)$
• addEdge(GraphEdge<L> edge) → $\Theta(1)$
• removeEdge(GraphEdge<L> edge) → $\Theta(1)$
• containsEdge(GraphEdge<L> edge) → $\Theta(1)$
• getEdgesOf(GraphNode<L> node) → $\Theta(n)$