Path: utzoo!dptcdc!jarvis.csri.toronto.edu!mailrus!tut.cis.ohio-state.edu!cs.utexas.edu!uunet!mcvax!kth!draken!liuida!mikpa
From: mikpa@majestix.ida.liu.se (Mikael Patel)
Newsgroups: comp.lang.c++
Subject: Re: Messaging overhead
Message-ID: <1247@majestix.ida.liu.se>
Date: 18 Apr 89 12:54:44 GMT
References: <1357@stl.stc.co.uk>
Organization: CIS Dept, Univ of Linkoping, Sweden
Lines: 6
In-reply-to: dsr@stl.stc.co.uk's message of 17 Apr 89 09:50:26 GMT

Hi, the answer is NO. Typically the application you are doing the time
complexity of the overall algorithm is the major problem. C++ gives you inline
procedure expansion (when possible) and virtual procedure very cheap (approx.
an indirect subroutine call).

Your real problem is graph representation to reduce time complexity.