* Cantinho Satkeys

Refresh History
  • FELISCUNHA: Uma santa sexta feira para todo o auditório  4tj97u<z
    18 de Abril de 2025, 11:12
  • JPratas: try65hytr Pessoal  4tj97u<z classic k7y8j0
    18 de Abril de 2025, 03:28
  • cereal killa: try65hytr malta  classic 2dgh8i
    14 de Abril de 2025, 23:14
  • FELISCUNHA: Votos de um santo domingo para todo o auditório  101041
    13 de Abril de 2025, 11:45
  • j.s.: e um bom domingo de Ramos  43e5r6 43e5r6
    11 de Abril de 2025, 21:02
  • j.s.: tenham um excelente fim de semana  49E09B4F
    11 de Abril de 2025, 21:01
  • j.s.: try65hytr a todos  4tj97u<z
    11 de Abril de 2025, 21:00
  • JPratas: try65hytr  y5r6t Pessoal  classic k7y8j0
    11 de Abril de 2025, 04:15
  • JPratas: dgtgtr A Todos  4tj97u<z classic k7y8j0
    10 de Abril de 2025, 18:29
  • FELISCUNHA: ghyt74  pessoal   49E09B4F
    09 de Abril de 2025, 11:59
  • cereal killa: try65hytr pessoal  2dgh8i
    08 de Abril de 2025, 23:21
  • FELISCUNHA: Votos de um santo domingo para todo o auditório  43e5r6
    06 de Abril de 2025, 11:13
  • cccdh: Ola para todos!
    04 de Abril de 2025, 23:41
  • j.s.: tenham um excelente fim de semana  49E09B4F
    04 de Abril de 2025, 21:10
  • j.s.: try65hytr a todos  4tj97u<z
    04 de Abril de 2025, 21:10
  • FELISCUNHA: dgtgtr pessoal  49E09B4F  bom fim de semana  4tj97u<z
    04 de Abril de 2025, 14:29
  • JPratas: try65hytr Pessoal  4tj97u<z classic k7y8j0
    04 de Abril de 2025, 04:22
  • j.s.: try65hytr a todos  4tj97u<z
    03 de Abril de 2025, 21:00
  • migcontins: Quim Barreiros - A Esteticista (EP) 2025
    03 de Abril de 2025, 15:42
  • FELISCUNHA: ghyt74   49E09B4F  E bom fim de semana   4tj97u<z
    29 de Março de 2025, 10:06

Autor Tópico: C++ Algorithm Series Graphs  (Lida 333 vezes)

0 Membros e 1 Visitante estão a ver este tópico.

Online mitsumi

  • Moderador Global
  • ***
  • Mensagens: 118935
  • Karma: +0/-0
C++ Algorithm Series Graphs
« em: 24 de Julho de 2019, 11:20 »

C++ Algorithm Series: Graphs
MP4 | Video: AVC 1280x720 | Audio: AAC 44KHz 2ch | Duration: 3 Hours | 464 MB
Genre: eLearning | Language: English

Introducing Graphs. This first topic in this Graphs course explains the concept of graphs. A graph is a data structure which is represented as a finite set of nodes and edges. The nodes in a graph are called "vertices" and edges connect any two vertices. Explore graph use cases. Know the important graph concepts of adjacent, degree, in-degree, out-degree, path, connected graph, subgraph, connected component, tree, forest, and minimum spanning tree.
How a Computer Sees a Graph. This second topic in this Graphs course explains how to represent undirected and directed graphs in memory. All of the graph concepts from the first video are shown how they will look through the eyes of a computer. Practice the Edge List, Adjacency Matrix, and Adjacency List Approaches.
Implementing the Adjacency List Approach for Integers in C++. This third topic in this C++ Graphs course explains how to implement the very efficient Adjacency List Approach in C++ for integers. Follow along with Advait in this hands-on session.
Implementing the Adjacency List Approach for any Data Type in C++. This fourth topic in this C++ Graphs course explains how to implement the very efficient Adjacency List approach in C++ for any data type (not just integers). Follow along with Advait in this hands-on session as you create an Instagram follower graph.
Implementing Graph Traversal Algorithms C++. This fifth topic in this C++ Graphs course explains how to implement graph traversal algorithms in C++. A graph traversal algorithm is a method to traverse all of the nodes of a particular graph. There are two kinds of graph traversal algorithms: Breadth-First-Search (BFS) and Depth-First-Search (DFS). Follow along with Advait in this hands-on session as you create your first BFS algorithm in C++.
Implementing the Breadth-First-Search (BFS) to find the SSSP in C++. This sixth topic in this C++ Graphs course explains how to implement the Breadth-First-Search (BFS) algorithm to find the Single Source Shortest Path (SSSP) in C++. Follow along with Advait in this hands-on session.
Creating a Chutes and Ladders Game Using the SSSP in C++. This seventh topic in this C++ Graphs course reinforces the Single Source Shortest Path (SSSP) algorithm in C++. Follow along with Advait in this hands-on session as you create a Chutes and Ladders Game Using SSSP in C++.
Implementing the Depth First Search (DFS) Algorithm in C++. This eighth topic in this C++ Graphs course explains how to implement the Depth First Search (DFS) Algorithm in C++. Follow along with Advait in this hands-on session.
Finding the Number of Connected Components in a Graph Using the Depth First Search (DFS) Algorithm in C++. This ninth topic in this C++ Graphs course explains how to find the number of connected components in a graph using the Depth First Search (DFS) algorithm in C++. Follow along with Advait in this hands-on session.
Implementing a Topological Sort using the Depth First Search (DFS) Algorithm in C++. This tenth topic in this C++ Graphs course explains how to implement a topological sort using the Depth First Search (DFS) algorithm in C++. Follow along with Advait in this hands-on session.
Implementing a Topological Sort using the Breadth First Search (BFS) Algorithm in C++. This 11th topic in this C++ Graphs course explains how to implement a topological sort using the Breadth First Search (BFS) algorithm in C++. Follow along with Advait in this hands-on session as you apply Kahn's Algorithm, which is a slight modification of the BFS algorithm.
Implementing Cycle Detection in Undirected Graphs using BFS in C++. This 12th topic in this C++ Graphs course explains how to perform cycle detection in undirected graphs using the Breadth First Search (BFS) algorithm in C++. Follow along with Advait in this hands-on session.
Implementing Cycle Detection in Directed                                                                                                                                                                                                Graphs using DFS in C++. This 13th topic in this C++ Graphs course explains how to perform cycle detection in directed graphs using the Depth First Search (DFS) algorithm in C++. Follow along with Advait in this hands-on session.
             

               

Download link:
Só visivel para registados e com resposta ao tópico.

Only visible to registered and with a reply to the topic.

Links are Interchangeable - No Password - Single Extraction