Hands-On Data Structures and Algorithms with Rust by Claus Matzinger

Author:Claus Matzinger
Language: eng
Format: epub, pdf
Tags: COM051070 - COMPUTERS / Programming Languages / C++, COM051220 - COMPUTERS / Programming / Parallel, COM051000 - COMPUTERS / Programming / General
Publisher: Packt Publishing
Published: 2019-01-24T07:08:26+00:00

The tree's downsides are few.

Downsides

Absolute performance depends significantly on the tree's order; other than that, this tree does not have many downsides.

Graphs

In their most generic form, trees are graphs—directed, acyclic graphs. A general graph can be described as a collection of connected nodes, sometimes referred to as vertices, with certain properties such as whether cycles are allowed. The connections between those also have their own name: edges. These edges can have certain properties as well, in particular, weights and directions (like one-way streets).

By enforcing these constraints, a model can be built that, just like trees, reflects a certain reality very well. There is one particular thing that is typically represented as a weighted graph: the internet. While, nowadays, this might be an oversimplification, with various versions of the Internet Protocol (IPv4 and IPv6) and Network Address Translation (NAT) technologies hiding large numbers of participants online, in its earlier days, the internet could be drawn as a collection of routers, computers, and servers (nodes) interconnected with links (edges) defined by speed and latency (weights).

The following diagram shows a random, undirected, unweighted graph:

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.