Math & Optimizations: Introducing Graphs & Graph Operations

Math    |    Intermediate
  • 12 videos | 1h 28m 41s
  • Includes Assessment
  • Earns a Badge
Rating 4.4 of 35 users Rating 4.4 of 35 users (35)
The graph data structure plays a significant role in modeling entities in the real world. A graph comprises nodes and edges that are used to represent entities and relationships, respectively. A graph can be used to model a social network or a professional network, roads and rail infrastructure, and telecommunication and telephone networks. Through this course, you'll explore graph data structure, graph components, and different types of graphs and their use cases. Start by discovering how to represent directed, undirected, weighted, and unweighted graphs in NetworkX. You'll then learn more about visualizing nodes and connections in graphs using Matplotlib. This course will also help you examine how to implement graph algorithms on all graph types using NetworkX. Upon completing this course, you will have the skills and knowledge to create and work with graphs using NetworkX in Python.

WHAT YOU WILL LEARN

  • Discover the key concepts covered in this course
    Model entities and relationships in the real world using graphs
    Recognize the different types of graphs, their characteristics, and use cases
    Create undirected graphs using networkx
    Associate attributes with the graph, individual nodes, and individual edges
    Create directed graphs using networkx
  • Compute the degree of a graph node
    Identify predecessors and successors in a directed graph
    Compute simple cycles, triangles, and edge covers using networkx
    Perform topological sorting in a directed acyclic graph
    Compute the shortest path and a minimum spanning tree for a graph
    Summarize the key concepts covered in this course

IN THIS COURSE

  • 2m 5s
  • 7m 57s
  • Locked
    3.  Types of Graphs
    8m 20s
  • Locked
    4.  Creating Undirected Graphs Using NetworkX
    10m 43s
  • Locked
    5.  Adding Attributes to Graphs Nodes and Edges
    12m
  • Locked
    6.  Creating Directed Graphs Using NetworkX
    9m 9s
  • Locked
    7.  Computing Degree of a Node
    6m 6s
  • Locked
    8.  Understanding Predecessors and Successors
    5m 23s
  • Locked
    9.  Computing Simple Cycles, Triangles, and Edge Covers
    6m 35s
  • Locked
    10.  Performing Topological Sort
    8m 31s
  • Locked
    11.  Computing Shortest Path and Minimum Spanning Tree
    9m 55s
  • Locked
    12.  Course Summary
    1m 57s

EARN A DIGITAL BADGE WHEN YOU COMPLETE THIS COURSE

Skillsoft is providing you the opportunity to earn a digital badge upon successful completion on some of our courses, which can be shared on any social network or business platform.

Digital badges are yours to keep, forever.

YOU MIGHT ALSO LIKE

Book Graph Algorithms for Data Science: With examples in Neo4j
Course Prompt Engineering for Data: Leveraging Prompts When Working with Data
Rating 5.0 of 1 users Rating 5.0 of 1 users (1)
Book Python for Engineering and Scientific Computing

PEOPLE WHO VIEWED THIS ALSO VIEWED THESE

Course Math & Optimizations: Introducing Sets & Set Operations
Rating 4.4 of 177 users Rating 4.4 of 177 users (177)
Course Core Statistical Concepts: An Overview of Statistics & Sampling
Rating 4.5 of 57 users Rating 4.5 of 57 users (57)
Course Python & Matplotlib: Creating Box Plots, Scatter Plots, Heatmaps, & Pie Charts
Rating 4.3 of 18 users Rating 4.3 of 18 users (18)