GraphStream Users

Archives de la liste Aide

Complexity of method Graph::getNode(String id)

Chronologique Discussions 
  • From: <simone.davico AT>
  • To: graphstream-users AT
  • Subject: Complexity of method Graph::getNode(String id)
  • Date: Wed, 4 Dec 2013 10:55:10 +0100 (CET)

Hello everyone,

I was wondering what is the complexity of the method Graph::getNode(String
What is used to retrieve the node in the graph? Is it implemented as linear
search? Binary Search? Or maybe it uses a Map and allows constant time

This is very critical for the project I'm working on, as I could find myself
the situation of handling a huge quantity of nodes and I have to know if calls
to this method are computationally expensive.

Thank you for your help!


Archives gérées par MHonArc 2.6.16.

Top of page