VoidNoir0 has quit [Quit: Ping timeout (120 seconds)]
jetchisel has quit [Ping timeout: 245 seconds]
hansolo has joined #ruby
jetchisel has joined #ruby
slightlypandaish has quit [Ping timeout: 256 seconds]
lad has quit [Ping timeout: 245 seconds]
tkonto has quit [Quit: tkonto]
jetchisel has quit [Ping timeout: 252 seconds]
_ht has quit [Remote host closed the connection]
jetchisel has joined #ruby
slightlypandaish has joined #ruby
jpw has quit [Remote host closed the connection]
sharkee has quit [Ping timeout: 252 seconds]
Oxfuxxx has quit [Ping timeout: 245 seconds]
<weaksauce>
nakilon what kind of algorithm have you been working on?
slightlypandaish has quit [Quit: Client closed]
markong has joined #ruby
asio_ has quit [Ping timeout: 252 seconds]
taupiqueur has quit [Remote host closed the connection]
taupiqueur has joined #ruby
jmcgnh has quit [Ping timeout: 246 seconds]
Synthead has joined #ruby
<Synthead>
I'm trying to match words with regex. Vim's regex can do \<word\>, and only match the specfiic word. For example, in "that thats thatthat", it'll only match the first "that". Is there something similar in ruby?
<weaksauce>
it's a good idea to scan through the character classes available to know what's possible at least once even if you never use them
<weaksauce>
it's a ton of them
<Synthead>
awesome
<Synthead>
thanks so much!
<weaksauce>
np
<nakilon>
weaksauce shortest path through all the vertices
<weaksauce>
TSP?
<nakilon>
not a loop
jmcgnh has joined #ruby
<weaksauce>
oh so something like the floyd-warshall algo
<nakilon>
idk
<nakilon>
I do my wheel )
<weaksauce>
all pairs shortest path algorithm is the class
<weaksauce>
of algorithms
lad has joined #ruby
<weaksauce>
i'd be surprised if you could get it working like that... the FW algo is a dynamic programming one
<weaksauce>
and is O(|V|^3)
<Rounin>
"Shortest path through all the vertices"... That sounds very travelling salesman
<nakilon>
I had an idea but now when I implemented it it gets stuck ( https://i.imgur.com/3vN4ywG.png -- it was supposed to grow and resolve the 3-star cases by shaking them and blacklisting on each shake
<nakilon>
maybe backtracking would help but I so much don't want any recursion
nmollerup has joined #ruby
<nakilon>
ok so when it's stuck I unblacklist the oldest edge that is involved until it's not stuck
<nakilon>
seems working, ran 50 times on 10 vertices graph
<nakilon>
heh, on 100 vertices it takes from 1 sec to 20