blockversewordysbillionaire.aiyourlistWhiteboardAppquizieunschool

News

Home
Popular
Elections

Genius — OpenServe

Sponsored

walk — latest news, discussion & facts — IJR

walk

Topic

walk

sequence of edges connecting a sequence of vertices in a graph, possibly with repeated vertices and/or edges

0members1here now

Ask Genius Site

Feed Discussions About

Loading

Comments

Ask Genius by OpenServe:

Free account · your comment posts right after signup

About walk

In graph theory, a path in a graph is a finite or infinite sequence of edges which joins a sequence of vertices which, by most definitions, are all distinct. A directed path in a directed graph is a finite or infinite sequence of edges which joins a sequence of distinct vertices, but with the added restriction that the edges be all directed in the same direction.

0

members

1

here now

Everything about walk →

Live room · 1 here

Be the first in the room — members see you arrive.

Facts from Wikidata (CC0).

Not who you're looking for? Others named walk: 1993 extended plays by Pantera · debut single of British singer Kwabs · 2023 Indian film · historical city in Livonia