/sci/ - Science & Math » Thread #11084848

179KiB, 750x456, 5_Graph_types-750x456.png

View Same Google iqdb SauceNAO

Anonymous Wed 23 Oct 11:47:05 2019 No.11084848 View Reply Original Report

Quoted By: >>11084883 >>11085124

Given a set of vertices, what's the fastest way to find what path they form on a graph?
What algorithm is the fastest for doing that?

Anonymous

Anonymous Wed 23 Oct 2019 12:21:00 No.11084883 Report

Quoted By: >>11084921

>>11084848
>what path they form
What do you mean?

Anonymous

Anonymous Wed 23 Oct 2019 12:47:11 No.11084921 Report

Quoted By:

>>11084883
https://en.wikipedia.org/wiki/Path_(graph_theory)

Anonymous

Anonymous Wed 23 Oct 2019 14:31:13 No.11085076 Report

Quoted By:

A set of vertices does not define a single path. When you tell someone the car journey you took to get somewhere, you don't tell them the cities you went through in an arbitrary order, do you?

It does however define a set of paths, which (in the case that there is a loop somewhere) is not necessarily finite

So what precisely are you after?

Anonymous

Anonymous Wed 23 Oct 2019 14:55:26 No.11085124 Report

Quoted By:

>>11084848
Your pic is pretty misleading.

Undirected means the adjacency matrix is symmetric (i.e. if you mirror around yellow diagonal it's the same matrix)

Directed means it's not necessarily symmetric.

Both types can have various information associated with nodes and/or edges such as labels and weights.

Capcode	All Only User Posts Only Moderator Posts Only Admin Posts Only Developer Posts
Show Posts	All Only With Images Only Without Images
Deleted Posts	All Only Deleted Posts Only Non-Deleted Posts
Ghost Posts	All Only Ghost Posts Only Non-Ghost Posts
Post Type	All Only Sticky Threads Only Opening Posts Only Reply Posts
Results	All Grouped By Threads
Order	Latest Posts First Oldest Posts First

Your latest searches