Simulation for applied graph theory using Visual C++ (Q2803237)

From MaRDI portal





scientific article; zbMATH DE number 6577037
Language Label Description Also known as
default for all languages
No label defined
    English
    Simulation for applied graph theory using Visual C++
    scientific article; zbMATH DE number 6577037

      Statements

      0 references
      0 references
      4 May 2016
      0 references
      graph theory algorithms
      0 references
      Visual C++
      0 references
      C++ source code
      0 references
      simulation
      0 references
      combinatorial optimization
      0 references
      Simulation for applied graph theory using Visual C++ (English)
      0 references
      This book, split into ten chapters, presents both a theoretical and a practical approach to scientific computing in applied graph theory using the Microsoft Visual C++ platform. The first two chapters consider preliminaries of graph theory and the fundamental data structures used to represent graphs, paths and trees, as well as how to visualize the output using the Microsoft Foundation Classes. The rest of the book consists of code listings for specific graph theory problems, including graph coloring, shortest paths, minimum spanning trees, maximum cliques, convex hulls and Delaunay triangulations, scheduling and network routing. The book is particularly pleasant to read and the topics considered follow a logical progression in terms of complexity while covering at the same time a very wide and varied set of graph theory problems. Each chapter contains the necessary C++ source code to implement each algorithm, which is very clearly written and easy to adapt or extend as necessary, providing researchers working on simulation problems in graph theory with an essential toolkit for good-quality source code.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references