Lecture

Directed Graphs: Introduction and Categories

Description

This lecture introduces the fundamental notion of composition of applications in the context of directed graphs, also known as quivers. It covers the definition of a directed graph, consisting of classes of vertices and edges with domain and codomain functions. Examples of directed graphs are provided, illustrating relations on sets and their representation as directed graphs.

Instructor

duis amet

Culpa culpa enim cillum sint. Magna amet duis ullamco ullamco ex do in culpa. Excepteur nisi culpa qui sit deserunt do cupidatat esse minim qui consequat eu anim. Enim et ad excepteur fugiat adipisicing fugiat ipsum proident cupidatat in nulla dolor. Eiusmod incididunt elit officia eu id eu excepteur cillum eiusmod do. Cillum labore aute culpa Lorem in minim cillum commodo minim laboris excepteur.

Official source

https://mediaspace.epfl.ch/media/0_dwvvrnng

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Mathematics

Discrete mathematics: Graph theory

Mathematical logic: Set theory

Related lectures (29)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.