Difference between a walk and a path

Balaji Jegan asked Jan 22, 2018

1,038 views

See all

Please log in or register to answer this question.

Related questions

4 votes

2 answers

lowOnATP asked Jun 29, 2015

2,565 views

What is the exact difference between prim's minimum spanning tree algorithm and dijkstra's single source shortest path algorithm?

I mean if we run prim's algorithm on a weighted directed graph, will it give the same shortest path? And vice-versa?Also if we run dijkstra's algorithm on a graph with ne...

lowOnATP

2.6k views

lowOnATP asked Jun 29, 2015

2 votes

1 answer

gmrishikumar asked Apr 28, 2019

847 views

Difference between DAG and Multi-stage graph
I have trouble understanding the difference between DAG and Multi-stage graph. I know what each of them is But I think that a multi-stage graph is also a DAG. Are multi-stage graphs a special kind of DAG?

I have trouble understanding the difference between DAG and Multi-stage graph. I know what each of them isBut I think that a multi-stage graph is also a DAG. Are multi-st...

gmrishikumar

847 views

gmrishikumar asked Apr 28, 2019

0 votes

0 answers

srestha asked Nov 16, 2018

847 views

Graph Theory(Eular walk)
$A)$ If a graph has closed Eularian walk, then it has an even number of edges $B)$ If $G$ be a simple graph on $9$ vertices and the sum of all degrees in $G$ is atleast $27$, then $G$ has a vertex of degree atleast $4$. Which Statement should be true? Is it possible B) to be true? And for A) I think "only if" is needed in place of "if" to be true

$A)$ If a graph has closed Eularian walk, then it has an even number of edges$B)$ If $G$ be a simple graph on $9$ vertices and the sum of all degrees in $G$ is atleast $2...

srestha

847 views

srestha asked Nov 16, 2018

0 votes

0 answers

Anand. asked Dec 31, 2016

580 views

A graph $G$ is Eulerian path iff degree of each vertex is even with atmost one trivial component
For this proof ,proving $\Rightarrow$ If Graph $G$ is eulerian then degree of each vertex is even with atmost one trivial component. As $G$ is Eulerian ,it means it **must not** repeat Edges but can repeat ... $C,F =3$ contradictory.... help me out where i am wrong

For this proof ,proving$\Rightarrow$ If Graph $G$ is eulerian then degree of each vertex is even with atmost one trivial component.As $G$ is Eulerian ,it means it must n...

Anand.

580 views

Anand. asked Dec 31, 2016

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

Difference between a walk and a path

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

Related questions

0 reply

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

Related questions

0