FOLLOW AN IDEA
Euler paths traverse each edge once; Hamilton paths visit each vertex once.
Explore concept graph · Explore connected videos
No reviewed video yet. Explore the concept in a map or suggest a resource. Suggest a video
Time and space requirements are expressed as functions of input size under a computational model.
A matching is a set of edges with no shared endpoints.
Vertices and edges model connections, with directed and undirected variants.
A planar graph can be drawn without edge crossings except at shared endpoints.
Dijkstra solves non-negative networks; Bellman-Ford tolerates negative edges and underpins route pricing.
Connect functions and counting with elementary number theory, graph structures and algorithmic reasoning. Shared concepts and reviewed map connections organize the path; video explanations are added as resources pass review.
Explore graph structures; paths, coloring and planarity; networks and spectral viewpoints. Concepts and connections are available independently of video coverage.