2025-07-24 –, Main Room 3
Julia's dynamism, extensive specialization, and metaprogramming make it uniquely suited to express sparse and graph algorithms. This talk will explore the suitability of Julia for graph algorithms, covering several algorithms and their real-world use cases. We will discuss the challenges of implementing graph algorithms in Julia as well and how to overcome them. Practical examples and code snippets will be included to illustrate the concepts discussed.
Julia's dynamism, extensive specialization, and metaprogramming make it uniquely suited to express sparse and graph algorithms. This talk will explore the suitability of Julia for graph algorithms, covering several algorithms and their real-world use cases. We will discuss the challenges of implementing graph algorithms in Julia as well and how to overcome them. Practical examples and code snippets will be included to illustrate the concepts discussed.
