Java : Print hashmap of lists in O(n)

Question

Is it possible to print hashmap of lists in O(n)?

I was about to do somethin like this:

for(Map.Entry<String, ArrayList<Edge>> e : map.entrySet()){
   for(Edge e1 : e.getValue())
      System.out.println(e.getKey() + " = "+ e1.Out());
}

but this is O(n^2)

my hashmap:

private Map<K, List<Edge<K,E>>> G = null;

I tried to do something like this:

public void getEdges(){
    getEdges(0);
}
private void getEdges(int i){
        if(i==this.G.size()){
            return;
        }else{
        List<Edge<K, E>> edgeList = this.G.get(this.G.keySet().toArray()[i]);
        for(Edge<K, E>  e : edgeList) {
            System.out.println("Edges : "+e.toString());
        }
        getEdges(i+1);
    }
}

But this is not O(n)

Answer 1

but this is O(n^2)

It is actually O(E) where E is the total number of edges.

And you cannot improve on that ¹ .

---

^{1 - At least, from the complexity perspective.}