drag nodes · degree sequence · Eulerian path · BFS shortest path
presets
graph (drag nodes to rearrange)
properties
vertices |V|6
edges |E|6
connectedYES
degree sequence2, 2, 2, 2, 2, 2
EulerianEulerian (circuit)
all vertices have even degree → Eulerian circuit exists
BFS shortest path
fromto
>ready