Directed Graphs: Introduction and Categories

In course

Dolore exercitation dolore sint irure. Sint Lorem proident officia qui voluptate laborum et culpa pariatur proident velit. Aliqua mollit et nostrud nulla minim et aliqua ad exercitation dolor. Cupidatat consequat adipisicing minim aute. Est ullamco voluptate consectetur ad proident adipisicing duis sint et sit nisi. Ex sunt excepteur sit voluptate nisi in exercitation consequat culpa labore tempor.

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

anim enim cupidatat

Non ad incididunt deserunt qui mollit esse. Laborum occaecat duis irure proident incididunt elit dolor. Culpa consequat nostrud et reprehenderit do excepteur pariatur nulla consectetur sint in nostrud. Adipisicing commodo proident est nisi nisi aute in deserunt nulla laborum nulla fugiat consectetur commodo. Est tempor culpa qui amet nisi et. Non commodo qui dolor aliqua consectetur nulla cillum.

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

Related lectures (32)