Graphs/Euler Circuit

From charlesreid1

Revision as of 23:05, 26 April 2019 by Admin (talk | contribs) (→‎Related)

Overview

An Euler circuit (like a closed circuit) is an Euler Path that starts and ends on the same vertex.


Related

Euler Tour (a.k.a. Euler Path):

Euler Circuit:

Instructions for finding connected components:

Flags



GraphFlag.png
Graphs
notes on graph theory, graph implementations, and graph algorithms

Part of Computer Science Notes

Series on Data Structures


Graphs


Graph Theory:

Graphs/Definitions  · Graphs/Matching  · Graphs/Connectivity

First Theorem of Graph Theory


Graph Implementations:

Graphs/Data Structures  · Graphs/ADT

Graphs/Java/Adjacency Map  · Graphs/Java/Adjacency Map Lite

Graphs/Guava


Graph Algorithms:

Algorithms/Graphs


Traversal:

Graphs/Traversal  · Graphs/Euler Tour  · Graphs/Depth First Traversal  · Graphs/Breadth First Traversal

Category:Traversal


Connectivity and Cycles:

Graphs/Finding Cycles  · Graphs/Finding Connected Components  · Graphs/Reachability


Transitive Closure:

Graphs/Transitive Closure  · Graphs/Floyd Warshall Algorithm


Shortest Path:

Graphs/Shortest Path  · Graphs/Edge Relaxation  · Graphs/Dijkstra


Minimum Spanning Tree:

Graphs/Minimum Spanning Tree  · Graphs/Prim Jarnik Algorithm  · Graphs/Kruskal Algorithm

Graphs/Cluster Finding


Directed Acyclic Graphs:

DAGs  · Graphs/Cycles  · Graphs/Topological Sort


Category:Graphs  · Category:Algorithms  · Category:CS  · Category:Data Structures


Flags  · Template:GraphsFlagBase  · e



Retrieved from "https://charlesreid1.com/w/index.php?title=Graphs/Euler_Circuit&oldid=26559"