RE: Generating Graphical Diagrams/Maps from Nmap output

["Sina Bahram" <sbahram () nc rr com>]

*smile*, no no:

I don't mean graphs in the visual sense, well I kind of do. I'm speaking of
computer science graphing algorithms as in kruskal, breath first search,
depth first search, minimum spanning tree, and so forth.

Take care,
Sina

-----Original Message-----
From: nmap-dev-bounces () insecure org [mailto:nmap-dev-bounces () insecure org]
On Behalf Of Nils Magnus
Sent: Monday, May 22, 2006 2:09 AM
To: Sina Bahram
Cc: nmap-dev () insecure org
Subject: Re: Generating Graphical Diagrams/Maps from Nmap output

Re,

On Mon, May 22, 2006 at 01:15:21AM -0400, Sina Bahram wrote:
> I would recommend that certain graphing algorithms be used to help 
> with this.
>
> For example: couldn't minimum  spanning trees be used to isolate 
> subnets if the initial graph is setup correctly?

This is less a question of graphing layout algorithms but much more a
question of data structures.

I hope that the layout of the output can be somehow adjusted by the user
interactively since all generic layout algorithms I have seen so far have
medium to major problems if it comes to scalability.

Regards,

Nils Magnus
Program-Chair LinuxTag 2006 Free Conference Program

LinuxTag 2006: Where .com meets .org - magnus () linuxtag org


_______________________________________________
Sent through the nmap-dev mailing list
http://cgi.insecure.org/mailman/listinfo/nmap-dev



_______________________________________________
Sent through the nmap-dev mailing list
http://cgi.insecure.org/mailman/listinfo/nmap-dev