Revision as of 09:53, 19 May 2024 edit Agent VII (talk \| contribs) Extended confirmed users, Page movers, New page reviewers, Temporary account IP viewers 6,695 edits →Definition Tags: Visual edit: Switched Newcomer task Newcomer task: references ← Previous edit		Revision as of 20:09, 30 May 2024 edit undo Avyanna.Owam (talk \| contribs) 67 edits Changed grammar and tone Tags: Visual edit Mobile edit Mobile web edit Newcomer task Newcomer task: references Next edit →
Line 7: ==Definition== The shortest path problem can be defined for [[Graph (discrete mathematics)\|graphs]] whether [[Graph (discrete mathematics)#Undirected graph\|undirected]], [[Graph (discrete mathematics)#Directed graph\|directed]], or [[Mixed graph\|mixed]]. ItHere it is defined ~~here~~ for undirected graphs; for directed graphs the definition of path requires that consecutive vertices be connected by an appropriate directed edge.<ref>{{cite book \|last1=Deo \|first1=Narsingh \|title=Graph Theory with Applications to Engineering and Computer Science \|date=17 August 2016 \|publisher=Courier Dover Publications \|isbn=978-0-486-80793-5 \|url=https://www.google.com/books/edition/_/uk1KDAAAQBAJ \|language=en}}</ref> Two vertices are adjacent when they are both incident to a common edge.

Shortest path problem: Difference between revisions