Graph algorithms the fun way:
"This book provides a fun and accessible introduction to graph algorithms, a type of data structure used to solve a wide range of problems in mathematics and computer science. The book uses diagrams and real-world examples in the Python programming language to teach readers about the structure...
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | Englisch |
| Veröffentlicht: |
San Francisco, CA
No Starch Press
[2025]
|
| Schlagwörter: | |
| Links: | https://learning.oreilly.com/library/view/-/9781098182519/?ar |
| Zusammenfassung: | "This book provides a fun and accessible introduction to graph algorithms, a type of data structure used to solve a wide range of problems in mathematics and computer science. The book uses diagrams and real-world examples in the Python programming language to teach readers about the structure of graphs and how they can represent connections using different graphing algorithms. Readers will apply this knowledge to problems such as finding the shortest paths through a graph; estimating costs of paths through a graph; randomizing graphs; prioritizing nodes; determining which components in a graph are essential to maintaining its integrity; and calculating how much data can flow from one point in a graph to the next"-- |
| Beschreibung: | Includes index. - Description based on print version record and CIP data provided by publisher; resource not viewed |
| Umfang: | 1 Online-Ressource |
| ISBN: | 9781718503878 1718503873 |
Internformat
MARC
| LEADER | 00000nam a22000002 4500 | ||
|---|---|---|---|
| 001 | ZDB-30-ORH-109653319 | ||
| 003 | DE-627-1 | ||
| 005 | 20241107103330.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 241107s2025 xx |||||o 00| ||eng c | ||
| 020 | |a 9781718503878 |c ebook |9 978-1-7185-0387-8 | ||
| 020 | |a 1718503873 |9 1-7185-0387-3 | ||
| 035 | |a (DE-627-1)109653319 | ||
| 035 | |a (DE-599)KEP109653319 | ||
| 035 | |a (ORHE)9781098182519 | ||
| 035 | |a (DE-627-1)109653319 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rda | ||
| 041 | |a eng | ||
| 082 | 0 | |a 518/.1 |2 23/eng/20240628 | |
| 100 | 1 | |a Kubica, Jeremy |e VerfasserIn |4 aut | |
| 245 | 1 | 0 | |a Graph algorithms the fun way |c by Jeremy Kubica |
| 263 | |a 2411 | ||
| 264 | 1 | |a San Francisco, CA |b No Starch Press |c [2025] | |
| 300 | |a 1 Online-Ressource | ||
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a Computermedien |b c |2 rdamedia | ||
| 338 | |a Online-Ressource |b cr |2 rdacarrier | ||
| 500 | |a Includes index. - Description based on print version record and CIP data provided by publisher; resource not viewed | ||
| 520 | |a "This book provides a fun and accessible introduction to graph algorithms, a type of data structure used to solve a wide range of problems in mathematics and computer science. The book uses diagrams and real-world examples in the Python programming language to teach readers about the structure of graphs and how they can represent connections using different graphing algorithms. Readers will apply this knowledge to problems such as finding the shortest paths through a graph; estimating costs of paths through a graph; randomizing graphs; prioritizing nodes; determining which components in a graph are essential to maintaining its integrity; and calculating how much data can flow from one point in a graph to the next"-- | ||
| 650 | 0 | |a Graph algorithms | |
| 650 | 0 | |a Python (Computer program language) | |
| 650 | 4 | |a Algorithmes de graphes | |
| 650 | 4 | |a Python (Langage de programmation) | |
| 776 | 1 | |z 9781718503861 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781718503861 |
| 966 | 4 | 0 | |l DE-91 |p ZDB-30-ORH |q TUM_PDA_ORH |u https://learning.oreilly.com/library/view/-/9781098182519/?ar |m X:ORHE |x Aggregator |z lizenzpflichtig |3 Volltext |
| 912 | |a ZDB-30-ORH | ||
| 951 | |a BO | ||
| 912 | |a ZDB-30-ORH | ||
| 049 | |a DE-91 | ||
Datensatz im Suchindex
| DE-BY-TUM_katkey | ZDB-30-ORH-109653319 |
|---|---|
| _version_ | 1821494925862109184 |
| adam_text | |
| any_adam_object | |
| author | Kubica, Jeremy |
| author_facet | Kubica, Jeremy |
| author_role | aut |
| author_sort | Kubica, Jeremy |
| author_variant | j k jk |
| building | Verbundindex |
| bvnumber | localTUM |
| collection | ZDB-30-ORH |
| ctrlnum | (DE-627-1)109653319 (DE-599)KEP109653319 (ORHE)9781098182519 |
| dewey-full | 518/.1 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 518 - Numerical analysis |
| dewey-raw | 518/.1 |
| dewey-search | 518/.1 |
| dewey-sort | 3518 11 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02183nam a22004212 4500</leader><controlfield tag="001">ZDB-30-ORH-109653319</controlfield><controlfield tag="003">DE-627-1</controlfield><controlfield tag="005">20241107103330.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">241107s2025 xx |||||o 00| ||eng c</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781718503878</subfield><subfield code="c">ebook</subfield><subfield code="9">978-1-7185-0387-8</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1718503873</subfield><subfield code="9">1-7185-0387-3</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627-1)109653319</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)KEP109653319</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ORHE)9781098182519</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627-1)109653319</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">518/.1</subfield><subfield code="2">23/eng/20240628</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Kubica, Jeremy</subfield><subfield code="e">VerfasserIn</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Graph algorithms the fun way</subfield><subfield code="c">by Jeremy Kubica</subfield></datafield><datafield tag="263" ind1=" " ind2=" "><subfield code="a">2411</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">San Francisco, CA</subfield><subfield code="b">No Starch Press</subfield><subfield code="c">[2025]</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes index. - Description based on print version record and CIP data provided by publisher; resource not viewed</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">"This book provides a fun and accessible introduction to graph algorithms, a type of data structure used to solve a wide range of problems in mathematics and computer science. The book uses diagrams and real-world examples in the Python programming language to teach readers about the structure of graphs and how they can represent connections using different graphing algorithms. Readers will apply this knowledge to problems such as finding the shortest paths through a graph; estimating costs of paths through a graph; randomizing graphs; prioritizing nodes; determining which components in a graph are essential to maintaining its integrity; and calculating how much data can flow from one point in a graph to the next"--</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Graph algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Python (Computer program language)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithmes de graphes</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Python (Langage de programmation)</subfield></datafield><datafield tag="776" ind1="1" ind2=" "><subfield code="z">9781718503861</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9781718503861</subfield></datafield><datafield tag="966" ind1="4" ind2="0"><subfield code="l">DE-91</subfield><subfield code="p">ZDB-30-ORH</subfield><subfield code="q">TUM_PDA_ORH</subfield><subfield code="u">https://learning.oreilly.com/library/view/-/9781098182519/?ar</subfield><subfield code="m">X:ORHE</subfield><subfield code="x">Aggregator</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-30-ORH</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">BO</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-30-ORH</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield></datafield></record></collection> |
| id | ZDB-30-ORH-109653319 |
| illustrated | Not Illustrated |
| indexdate | 2025-01-17T11:22:08Z |
| institution | BVB |
| isbn | 9781718503878 1718503873 |
| language | English |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM |
| owner_facet | DE-91 DE-BY-TUM |
| physical | 1 Online-Ressource |
| psigel | ZDB-30-ORH TUM_PDA_ORH ZDB-30-ORH |
| publishDate | 2025 |
| publishDateSearch | 2025 |
| publishDateSort | 2025 |
| publisher | No Starch Press |
| record_format | marc |
| spelling | Kubica, Jeremy VerfasserIn aut Graph algorithms the fun way by Jeremy Kubica 2411 San Francisco, CA No Starch Press [2025] 1 Online-Ressource Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Includes index. - Description based on print version record and CIP data provided by publisher; resource not viewed "This book provides a fun and accessible introduction to graph algorithms, a type of data structure used to solve a wide range of problems in mathematics and computer science. The book uses diagrams and real-world examples in the Python programming language to teach readers about the structure of graphs and how they can represent connections using different graphing algorithms. Readers will apply this knowledge to problems such as finding the shortest paths through a graph; estimating costs of paths through a graph; randomizing graphs; prioritizing nodes; determining which components in a graph are essential to maintaining its integrity; and calculating how much data can flow from one point in a graph to the next"-- Graph algorithms Python (Computer program language) Algorithmes de graphes Python (Langage de programmation) 9781718503861 Erscheint auch als Druck-Ausgabe 9781718503861 |
| spellingShingle | Kubica, Jeremy Graph algorithms the fun way Graph algorithms Python (Computer program language) Algorithmes de graphes Python (Langage de programmation) |
| title | Graph algorithms the fun way |
| title_auth | Graph algorithms the fun way |
| title_exact_search | Graph algorithms the fun way |
| title_full | Graph algorithms the fun way by Jeremy Kubica |
| title_fullStr | Graph algorithms the fun way by Jeremy Kubica |
| title_full_unstemmed | Graph algorithms the fun way by Jeremy Kubica |
| title_short | Graph algorithms the fun way |
| title_sort | graph algorithms the fun way |
| topic | Graph algorithms Python (Computer program language) Algorithmes de graphes Python (Langage de programmation) |
| topic_facet | Graph algorithms Python (Computer program language) Algorithmes de graphes Python (Langage de programmation) |
| work_keys_str_mv | AT kubicajeremy graphalgorithmsthefunway |