From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-0.3 required=5.0 tests=BAYES_00,
	REPLYTO_WITHOUT_TO_CC autolearn=no autolearn_force=no version=3.4.4
X-Google-Thread: a07f3367d7,56525db28240414a
X-Google-Attributes: gida07f3367d7,public,usenet
X-Google-NewGroupId: yes
X-Google-Language: ENGLISH,UTF8
Received: by 10.66.82.7 with SMTP id e7mr1102863pay.17.1342924055585;
        Sat, 21 Jul 2012 19:27:35 -0700 (PDT)
Path: 
 b9ni25024092pbl.0!nntp.google.com!npeer03.iad.highwinds-media.com!news.highwinds-media.com!feed-me.highwinds-media.com!border3.nntp.dca.giganews.com!border1.nntp.dca.giganews.com!border4.nntp.dca.giganews.com!border2.nntp.dca.giganews.com!nntp.giganews.com!novia!news-peer1!btnet!zen.net.uk!hamilton.zen.co.uk!xlned.com!feeder5.xlned.com!feed.xsnews.nl!border-1.ams.xsnews.nl!plix.pl!newsfeed2.plix.pl!news.mi.ras.ru!goblin1!goblin3!goblin.stu.neva.ru!gegeweb.org!aioe.org!.POSTED!not-for-mail
From: "Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de>
Newsgroups: comp.lang.ada
Subject: Re: Efficient Sequential Access to Arrays
Date: Tue, 17 Jul 2012 10:42:53 +0200
Organization: cbb software GmbH
Message-ID: <sa5e3lhxl88s$.bk4sqlkau1mm$.dlg@40tude.net>
References: <01983f1c-f842-4b1f-a180-bcef531dad4c@googlegroups.com>
 <kpltof5a8xvm.arygetd4esmc.dlg@40tude.net>
 <44f2bfd0-75ed-4b9c-982e-61d5308f9c01@googlegroups.com>
 <1s8rnmtyqnrr$.1o78f1qaxeulh$.dlg@40tude.net>
 <e43d83de-d992-475b-bcfc-fafa13c4ea40@googlegroups.com>
 <1lgvwexsx8ovd.xdbvohz8eowp.dlg@40tude.net>
 <4c86d54d-dfeb-44f1-9638-3c416ea51d74@googlegroups.com>
 <iqxu0jiz121b.1i6qo6y7twnvp.dlg@40tude.net>
 <ca3e1b59-5bcc-4359-a6da-8ef3235502af@googlegroups.com>
 <n5f2c468x3m3.11so2phokj0ze$.dlg@40tude.net>
 <50050b14$0$6555$9b4e6d93@newsspool4.arcor-online.net>
Reply-To: mailbox@dmitry-kazakov.de
NNTP-Posting-Host: 9A8bJrx4NhDLcSmbrb6AdA.user.speranza.aioe.org
Mime-Version: 1.0
X-Complaints-To: abuse@aioe.org
User-Agent: 40tude_Dialog/2.0.15.1
X-Notice: Filtered by postfilter v. 0.8.2
X-Received-Bytes: 2947
Content-Type: text/plain; charset="utf-8"
Content-Transfer-Encoding: 8bit
Date: 2012-07-17T10:42:53+02:00
List-Id: <comp.lang.ada>

On Tue, 17 Jul 2012 08:50:00 +0200, Georg Bauhaus wrote:

> On 17.07.12 08:31, Dmitry A. Kazakov wrote:
>>> >‧ Network connectivity.
>> 1. Open amazon site
>> 2. Search "netwok adapter"
>> 3. Choose 5 different with minimal price
>> 4. Among them select one with maximal positive customer reports
>> 5. Buy it
>>
>> (Network connectivity is not an algorithmic problem)
> 
> Uh, I think it's connected graphs (V, E) here, not computers
> and ethernet cables.

For that matter the topology of ethernet cables can be represented by a
graph. As well as wires in a CAT cable or transistors of an Ethernet
controller etc.

> Or social relations. Just the abstraction.

The abstraction here is graph.
 
> A search engine result for "network connectivity algorithm":
> 
> Abstract:
> "This paper surveys the recent progress on the graph algorithms
> for solving network connectivity problems such as the extreme
> set problem, the cactus representation problem, the edge-connectivity
> augmentation problem and the source location problem. In particular,
> we show that efficient algorithms for these problems can be designed
> based on maximum adjacency orderings."

Yep, *graph* algorithms. To solve graph problems which may appear in an
application area of networking, e.g. packet routing etc.

-- 
Regards,
Dmitry A. Kazakov
http://www.dmitry-kazakov.de