#how do I do this

200 messages · Page 1 of 1 (latest)

rose ridgeBOT
#
  1. Ask your question and show the work you've done so far. If you've posted a screenshot of a question, specify which part you need help with.
  2. Wait patiently for a helper to come along.
  3. Once someone helps you, say thank you and close the thread with:
    +close
  4. Feel free to nominate the person for helper of the week in #helper-nominations
  5. Do not ping the mods, unless someone is breaking the rules.
  6. If you're happy with the help you got here, and the server overall, you can contribute financially as well:
tribal hare
#

@agile widget

#

@dull moth

dull moth
#

oh

tribal hare
#

hi

#

any idea

dull moth
#

well i mean it is just kruskal algorithm

tribal hare
#

yes

#

but then what do

#

becuase i need it to be traversable

#

like i do the even odd thing i was thinking

dull moth
tribal hare
#

how

#

the mst is not traversable

#

we need the shortest traversbale path that goes thorugh all point and where we can start at i and fisnh at o

#

if i udnerstood the question right

dull moth
#

like a subgraph

tribal hare
#

idk cus

#

like we jsut have to start at i and finsh at o

dull moth
#

oh wait

tribal hare
#

and we msut go to all node atleast once

dull moth
#

you have to be able to like

#

visit all point

#

without going through an edge twice

#

or it being disconnected

tribal hare
#

yes

dull moth
#

ah

tribal hare
#

um

#

no we dont need all edegs

#

we just need to to go throguh all nodes

dull moth
#

uhm

tribal hare
#

this is the exact question The inspector
would need the water to be flowing downhill, from the top at I, to the bottom at O. However, he wishes to have the water flowing through each of the other take points (in and out) so the water doesn't become stagnant. What is the shortest possible total length of such a system?

dull moth
#

the marking is a bit confusing

#

like the weight is kinda all over the place, could you write it down more nicely?

tribal hare
#

yes 100%

#

one sec on it right now

dull moth
#

what we try to find here is actually a tree without branches like a straight zigzag

#

since if there were to be branches

#

you would be forced to rewalk an edge twice

#

which is not allowed

tribal hare
#

but we gotta start at i and i is a even node

#

here is the mst drawn on

image.png
dull moth
#

which is non really traversable

tribal hare
#

yes

dull moth
#

we are tryna find like

tribal hare
#

but that was the first step right

#

that is jsut the shortest path

#

yes i get what you mean

dull moth
#

yeah it could help

tribal hare
#

but how do i know which to add on to get the shortest path

#

becuase there is more then 1 option i think

#

isit liek even and odd nodes we look at and then connect the odd nodes thats what i thoguht but i have no idea

dull moth
#

another thing in my mind is that you need to remove like 6 edges

#

so that could be helpful

#

so we dont over remove or under remove

tribal hare
#

why 6

#

ay remove we cant remove

dull moth
#

for any traversable path it would only need like 7 edges

#

we have 13 in here

tribal hare
#

oh i see

#

but we already got a short path we jsut to add to that to make it traverable

#

but i see what you mean

dull moth
#

since it could be a completely different algorithm

tribal hare
#

it probaly is its high school

dull moth
#

still be caution

tribal hare
#

we never learnt any other algothrim besides kruskals and traverablity

#

so we proably have to use that

dull moth
#

i suppose

tribal hare
#

but do you know how

#

how do i make the shortest path traversbale

#

like what do i add and why

dull moth
#

there is an algorithm actually

tribal hare
#

oh ok whats it called

dull moth
#

fleury algorithm

#

i think

tribal hare
#

but is it possible to do it terms of even and odd ndoes. I am confused because like do all od them need to be even. And only two odd.

dull moth
#

im maybe wrong

tribal hare
#

100% we aint expected to use that we have to use kruskals

dull moth
#

faulty memories

tribal hare
#

haha and then what we know about what makes a groah traversbakle

dull moth
#

actually i think you can like

#

remove edges so that you will have a graph of even degree yes

tribal hare
#

what do you think how would we get from the mst to a traverable graph. using like the even and odd nodes thing

dull moth
#

and calculate the weight we remove by removing said egdes

tribal hare
#

or can everhtign be even

dull moth
#

yeah no need

tribal hare
#

cus we have to start and finsh

dull moth
#

we actually just need to do this first step

#

then after that

tribal hare
#

igth whats the step

dull moth
#

remove like edges so that we have a graph of which all degree 2

tribal hare
#

wait what

dull moth
#

and calculated every weight you have removed

#

like sum it up

tribal hare
#

we can only add the context dose not allow us to remove paths

#

like we cna not indluce them

#

but we cant remove them

dull moth
#

yes

#

basically it is just a way for us to say "let's say we will not use this edges"

#

as our path

tribal hare
#

yes' i get you

#

so form the mst

#

or form the main graph

#

bro i am so confused

dull moth
#

from the main graph

tribal hare
#

oh ok remove what

#

remvoe line to make everhtign even

dull moth
#

yes

#

degree 2

#

and calculate the sum of the weight of the lines you had removed

tribal hare
#

what do i rmeove red is even yellow is odd

dull moth
#

remove the edges so that the final graph is basically a cycle that go through every vertices

#

that is removing any edges you like

#

at long as you have a cycle that go through all the point in the end

tribal hare
#

but it looks like there is more then one option to do that\

dull moth
#

yes

tribal hare
#

and that will effect the end result

dull moth
#

we are doing this multiple time

#

that is we are basically checking all the cycles that go through every vertices

#

in this graph

#

so we could calculate what is the best option

tribal hare
#

are you sure there is no easyier way

#

cus like we are ment to us the even and odd method

#

and jsut krusklas algothrim

#

that what we where told

dull moth
#

you only have to remove 5 of them

#

each time

tribal hare
#

ya that seems like a mroe comp sci method

#

but like we are told we need to. use krusklas algothrim

#

and then try and make the mst traversabel

#

your mehtod probally works better but we gotta do it that way unforgenally

dull moth
#

do that first

#

so you at least have a value to check

tribal hare
#

but do you knwo how do it the way i ment to do it.

dull moth
#

then you and i could think of how could me make it so that we can use the other way to do it

#

and do a sanity check

#

basically

tribal hare
#

like for a network to be traversble it need to have 2 or 0 odd nodes

dull moth
#

i know

tribal hare
#

the porblem says start at i and finsh at o

#

so

dull moth
#

but do it in a manual way first

#

so at least you could have a value to check

tribal hare
#

can I have all ndoe in my path as even. or do i need i and o to be odd. to start and finsh

#

this is jsut pratice i have a test tommrow with similler question

#

and have to do it that way

#

very similler question i am told

#

can I have all ndoe in my path as even. or do i need i and o to be odd.

dull moth
tribal hare
#

why

#

like whats the reaons

dull moth
#

it is a first step

#

so that you could at least eliminate the other cases that you just dont care

#

plus it is simpler to it in steps

tribal hare
#

ill try your way soon but how do i ahve to do the i am told to do

dull moth
#

that is for later, just get your hand into the problem first

tribal hare
#

bro i am runnign out of time

#

i have a test in an hour lol

dull moth
#

bruh

tribal hare
#

you are my only hope

dull moth
#

big dwag

#

that is on you

#

i could try to help but damn bruh

tribal hare
#

iahah no stress

dull moth
#

a test in a hour?

tribal hare
#

yup

dull moth
#

bruh

tribal hare
#

i have to do the a question liek this very similler

#

and have to use krustkals algorthim

#

and then like try to make the mst i get traversbale

#

by adding paths from the orignal graph

#

@dull moth where are you at

dull moth
#

im eating

#

like

tribal hare
#

ya np

dull moth
#

so you telling me you cant use any other method?

#

then just

#

krustkals algorthim but modified

#

okay

#

whatever your math teacher be doing

#

i cant help with that ngl

tribal hare
#

yup

dull moth
#

you could still use a method like mine

#

but if not

#

yeah it is a wrap

tribal hare
#

ight bro thank you

#

so much

#

very much

dull moth
#

sorry dwag, gl on what ever exam you got

tribal hare
#

na dont worry bro you gave me hope

tribal hare
#

yo @dull moth