|
所在平台: Udemy |
课程主页: https://www.udemy.com/course/implementing-graph-algorithms-using-scala/
课程评论：没有评论
课程名称：使用Scala实现图算法 课程概述：Scala的函数式编程特性有助于设计“易于推理”的系统，以便应对日益复杂的软件环境。在本课程中，我们通过解决各种图问题，练习许多函数式技术。课程开始时，我们学习如何高效地以函数式方式表示图结构。接下来，我们探索广度优先搜索和深度优先搜索的图遍历技术。随后，我们利用这些技术展示如何进行拓扑排序和循环检测。此外，课程还描述了更复杂的算法，例如寻找最短路径和最大流网络。所有解决方案均配有易于理解的图示和动画。在编写解决方案时，特别注重遵循函数式编程原则。完成本课程后，您将深入了解Scala的所有函数式概念，并重新巩固图算法的知识。 关于作者：詹姆斯·库塔贾是一名软件开发人员，专注于可扩展的高性能计算和分布式算法。他还是一名开源贡献者、作家、博主和技术传播者。在不写代码的时候，他喜欢骑摩托车、冲浪或驾驶轻型飞机。库塔贾出生在马耳他，在伦敦生活了近十年，目前在葡萄牙工作。
Scala's functional programming features are a boon to help you design "easy to reason about" systems to control growing software complexities.In this course we practise many functional techniques by solving various graph problems. We start by looking at how we can represent graph structures in an efficient functional manner. Then we explore both the breadth and depth first search graph traversal techniques. Later we use this techniques to show how they can be used for topological sorting and cycle detection. In this course we also describe more complex algorithms such as finding the shortest path and maximal flow networks. All of these solutions are illustrated with easy to understand diagrams and animations. Special care is taken when writing solution so that the principles of functional programming are followed.By the end of the course, you will be well-versed in all the functional concepts of Scala and you will have refreshed your knowledge of graph algorithms.About the authorJames Cutajar is a software developer with interests in scalable, high-performance computing and distributed algorithms. He is also an open source contributor, author, blogger, and tech evangelist. When he is not writing software, he is riding his motorbike, surfing, or flying light aircraft. He was born in Malta, lived for almost a decade in London, and is now working in Portugal.
