The Nineteenth Byte

Oh, my mistake - forgot ><> needs a number of arguments, so 0[. Well if you need a counter I guess that'd just be keeping a number on the stack and incrementing it each recurse?

New Sandboxed Posts

0

A: Sandbox for Proposed Challenges

Shortest infinte recursion Your task is writing a program/function that recursively calls itself ad infinitum. META: I know this is not a good definition yet, just a rough idea. If you have any thoughts on this please let me know. -Ideas: The program does have to do something simple like cou...

0

A: Sandbox for Proposed Challenges

Self-identification before golfing Since golfed code is harder to read, answers often contain an less golfed version. There are a number of potential golfing transformations depending on the language, so you may be able to score more highly using a more traditional language. Some examples of gol...

Jester Tran

hi

flawr

MC Hammer - U Can't Touch This

►

Jester Tran

anyone know C?

Katenkyo

9:16 AM

@JesterTran I am rusted, but I do

Jester Tran

@Katenkyo do you mind helping me with strange usage of data types?

Katenkyo

@JesterTran I can at least try ^^

Jester Tran

int add(int a, int b);

int (*test)(int, int);

test = add;

test(4,5); // new way of calling add

what is the purpose of the second line?

aditsu

it declares a variable test of type function of int and int returning int

Katenkyo

@JesterTran That would be a pointer to be executed as a function a laying down an integer value

Jester Tran

9:20 AM

is it practical?

Katenkyo

But are you sure it's plain C...?

Jester Tran

I'm learning C at the moment so it must be

aditsu

it's definitely plain C, and it's practical for passing functions around

Katenkyo

never came accross that, never knew it could be done

Thanks for the intel Oo

Jester Tran

@aditsu that is interesting...

To the main question:

typedef void (*test)(void *a);

what does that do?

Katenkyo

9:23 AM

define a pointer on a procedure that can accept a parameter a of any type

(void* isn't really "any type", but let's go with this for the moment)

aditsu

it defines a type alias named test, for a function that takes void* and returns void

Katenkyo

@aditsu in C, we name procedure a "function" declared with void as a return type

also, it doesn't return at all

aditsu

I doubt it's standard, but yes you can call it that

and the function may very well return (unless it has an infinite loop or something)

Jester Tran

so any function with prototype:
void functionName(void *variable);

has a new alias, "test"?

Katenkyo

@aditsu I don't know if it's standard by the c99 or what, but that's what it is name in books and in the community ^^

aditsu

9:27 AM

@JesterTran test is an alias for the function type

Katenkyo

@aditsu if you defined the function as void doSomething(void* a) it won't

aditsu

@Katenkyo yes it will, if it has a return statement and reaches it

Katenkyo

@aditsu doesn't it will cause a compile/runtime error?

aditsu

absolutely not

oh, it also returns if it reaches past the last line in the function block, of course

Jester Tran

@aditsu Ok, typedef is used for re-naming. So instead of void functionName(void *variable); we have test(... what?

aditsu

9:30 AM

@JesterTran not really like that, but you can write test x = functionName;

Jester Tran

@aditsu I see...

where does the "void *var" come into play?

aditsu

that's a function argument, you pass it when you call it and it's supposed to be used inside the function

Katenkyo

@aditsu effectively checked, you can write void a(){return;} without any problem Oo

Jester Tran

instead of calling it functionName, do we call it "x"?

Katenkyo

@JesterTran that's it

aditsu

9:34 AM

@Katenkyo sure you can; the return there is redundant but valid

Katenkyo

@aditsu never tried and always assumed it couldn't be done

aditsu

@JesterTran yeah, x is basically a pointer to that function, but you can call it just like calling the function

Jester Tran

the ultimate aim here is to pass functions?

aditsu

probably

you can also use this stuff to implement OOP

Jester Tran

thanks guys, I learnt a lot!!

Katenkyo

9:36 AM

OOP in C would be a pain...

You'd better go with C++ from the start

aditsu

yeah it's cumbersome, but I've seen it done

Jester Tran

wait, test x = functionName;

where does this go and where does the instructions for the function go?

Katenkyo

@JesterTran it means you already have defined functionName

aditsu

the instructions for the function go where you define the function; x goes anywhere you want (but probably not inside the function itself :p)

Jester Tran

riiiight XD

aditsu

9:42 AM

void functionName(void *variable); -> that's a declaration, not a definition

Katenkyo

so you'd have something like
void functionName(void* a){/*instructions*/}
test x= functionName

Jester Tran

@Katenkyo yep yep, makes sense

Katenkyo

@JesterTran actually, as long as you have the declaration above this affectation, the definition can be everywhere (as we're speaking about pointers :))

Jester Tran

@Katenkyo Ok

Quill

10:09 AM

digyourowngrave.com/csi-new-york-visual-basic

New Main Posts

10:42 AM

0

Q: Simulate Cookie Clicker

Intro Cookie Clicker is a popular browser game in which the player has to click a cookie to gain... Cookies! The player can buy upgrades which will automatically farm cookies for you. Sometimes a golden cookie will enter the screen, which will provide a bonus upon clicking it. Challenge This c...

code-golf

mınxomaτ

11:21 AM

Why is Bluetooth still so flaky in 2016...

But... but ... Bluetooth 4 :( (jk, it's horrible)

Quill

If you have to use Bluetooth for something, you can probably groan and not do that

mınxomaτ

I lost my line in lead, so I have to use BT now...

Quill

most of the world still operates on copper lines for everything

mınxomaτ

@Quill Well, I remember data over IR. It didn't work until the devices actually touched their sensors. And even then it was horrible.

I was tethering my GPRS mobile internet over IR to my PSION 3a :D

Quill

that reminds me of a conversation I overheard at work last week; apparently wireless car remotes have more range if you put them to your head

mınxomaτ

11:26 AM

Well, AOL wasn't really around in Germany (hence the A in AOL) :). But I guess that's older.

Though I remember AOL was one of the first free mail providers in Germany.

I'm not in a "Foreign Land", just another country. There are surprisingly many Germans here :P

mınxomaτ

11:53 AM

Post-processed Fencing is a thing I didn't know I needed in my life.

Katenkyo

@mınxomaτ It's fancy :D

Martin Büttner

P.S. if you want to scare the people at code golf with the complexity of the problem, link them to this paper. — J. M. ♦ 39 secs ago

Katenkyo

12:08 PM

@MartinBüttner Where was it posted?

Sp3000

You can click the timestamp

Katenkyo

Oh, right.... nevermind... I'm dumb

zyabin101

@QPaysTaxes Which game?

Katenkyo

^

zyabin101

Who's following the 64x64 gamejam on IO?

Katenkyo

12:20 PM

@QPaysTaxes jWhen I first learned pointers, I was angry because I didn't understand their usage... now, i'm angry when a language don't let me mess with them

zyabin101

@zyabin101 the what what on what?

itch.io/jam/lowrezjam2016

Katenkyo

@zyabin101 Did you take your pills?

zyabin101

@Katenkyo I did >:U

> jWhen

Katenkyo

@zyabin101 it is a new things to add to js

(I must be tired, speaking becomes incredibly hard -_-)

orlp

you guys know Erdős's "the Book"?

it's the book in which God keeps the most elegant proof for each mathematical theorem

sometimes I want to take a peek into "the Book" for code golfs :(

just to see what an optimal solution would look like

Katenkyo

12:34 PM

@orlp codegolfs ain't mathematical problems per se

orlp

@Katenkyo that doesn't matter

Katenkyo

But I agree that I'd love to see what an optimal solution in the language I golfed in would be

orlp

for example in Python

for a simple problem solved in 30-50 characters it'll probably have a cool trick or two

but already by ~150 characters I think it'll be mindblowing

Katenkyo

@orlp I would want to see it for lua because answers can easily be 200+ even for something not so hard

crayzeedude

1:14 PM

welp, my first puzzle has been on PPCG for nearly a month

zyabin101

@crayzeedude g'morning m8

crayzeedude

13 upvotes and still no answers

@zyabin101 monking

Maltysen

hi

first day of school after two weeks, so sleeeepy...

Mama Fun Roll

btw, is the function call for a quine necessary? (ex: in JS $=`$=${$};$()`;$(), is the ;$() necessary?)

zyabin101

@MamaFunRoll Is that the Bling quine?

Mama Fun Roll

1:16 PM

@zyabin101 Yes.

But can the part at the end (calling the function) be taken out?

New Sandboxed Posts

0

A: Sandbox for Proposed Challenges

Diamondize a Matrix Given a matrix, output a representation of the matrix where the top left element is on top, the anti-diagonal is the central row and the bottom right element is at the bottom. For example, consider the following matrix: 1 2 3 4 5 6 7 8 9 The diamond version of this matrix...

Maltysen

@Lembik I'm on a chromebook right now, but I'll put up timings when I get home. I'm surprised its this fast, but then again, I was testing on repl.it and it wasn't finishing N=6 in < 5 min.

So checking if the last one is < accuracy is not enough, the other ones can also pile up. I'm not sure if there is a good way to check if its enough.

trichoplax

@El'endiaStarman I like the red light because it's good for sleeping. I love sleeping.

Geobits

You don't have to put on the red light...

trichoplax

I was half expecting that :P

TimmyD

1:29 PM

ROOOOOOOOOOOOOOOOOOOXXXXXXXXXXXXXXXXXXXXXANNNNNNNNNNEE

trichoplax

And yet that took me by surprise...

I wish you wouldn't use all caps when I have the volume turned right up

TimmyD

Screenreading software?

trichoplax

Lol I love the idea of screenreading software that shouts louder when it's all caps.

No I was just being silly - the all caps make no difference to me

Geobits

If you're not careful you'll get tinnitus of the eye.

trichoplax

Outweirded

Zgarb

1:35 PM

@Sp3000 Is Grime broken?

crayzeedude

13

Q: Help develop Alphys' newest puzzle!

Alphys, the Underground's Royal Scientist, has finished a prototype for a new puzzle. However, she can't seem to find anyone willing to test it. The rules of her puzzle are as follows: The goal is to get to the right side, starting from the centermost tile on the left side. For puzzles with ev...

code-golf game path-finding

TimmyD

@Geobits Vidditus, maybe? Latin videre "to see" versus Latin tinnire "to ring".

My Latin is abysmal - purely guessing at the conjugation.

Geobits

Nah, I mean an audible ringing in the eye.

It's like when you see things from your ear, but the opposite.

trichoplax

I need to invest in some eye plugs before reading any more of this conversation

TimmyD

Sorta the opposite of a lazy eye -- a hyperactive eye.

Sp3000

1:42 PM

@Zgarb Not broken, but I was mentioning that basically the only 2D matching language which has a way of negating the output was Snails, which made it harder for the other languages to do Rectangle Detection

Zgarb

Grime has negation.

zyabin101

Is it just me or the background doesn't actually show up?

Sp3000

Oh? :o

Zgarb

A! matches iff A doesn't.

trichoplax

@zyabin101 In what context? Do you mean the chat background?

zyabin101

1:44 PM

@trichoplax Yup.

trichoplax

For me it shows up very subtly - more noticeable when it moves on scrolling

I wouldn't really want it to be any more noticeable

Sp3000

@Zgarb Did you want to give Rectangle Detection a shot then? :D

Zgarb

@Sp3000 Nah, it's not really an interesting problem for Grime.

And every time I want to use Grime, I remember that I should change its syntax.

Sp3000

Hmm, okay then

Quill

in The 2nd Monitor, 38 secs ago, by Quill

oh god why

Geobits

1:59 PM

It's the distro for people who ride their father's coattails to fame.

TimmyD

Badum-tsh

Best of Both Worlds Tour

Best of Both Worlds Tour was the debut concert tour by American recording artist Miley Cyrus. The tour was held to promote the double-disc album Hannah Montana 2: Meet Miley Cyrus (2007), which consisted of the soundtrack to Hannah Montana's second season and her debut studio album. It initiated in October 2007 and concluded in March 2008, visiting cities in the United States and Canada. The tour was promoted by AEG Live and Buena Vista Concerts. Labelmates the Jonas Brothers, Aly & A.J., and Everlife each served as opening act during the tour. One dollar from each ticket sold was donated to the...

Easterly Irk

@Quill 0/10 quite disturbing.

Zgarb

@Sp3000 I patched Grime and made a release. The only thing I changed was option syntax (it uses a backtick instead of comma, so no change for golfing purposes).

Maybe I should request adding it to TIO.

Sp3000

:)

Zgarb

@Dennis Are you able to add Grime to TIO? It only does file-based IO.

And needs Haskell to run.

Nathan Merrill

2:15 PM

@Dennis you should probably make a "How to get your language on TIO" post

Easterly Irk

@Zgarb I don't think he allows the file reading parts to stay, for anything.

@Downgoat:

                                                .--____.
                     ,_____._,                ,~-__,__,;\
                   ,/ /  / /~,\              ~'-_ ,~_/__--\
                 ,~'\/__:_; / ~\,_          /-__ ~\/  \";/,\
                / \ ,/\_\_~\ /  /|,';;;;`,|\  /\/     \=/- |
               ~--,/_/__  \ ~\ |  `._____.'  |/\/     __---=--
              /==/./ \ /\  ;\~\_\          _/\/,,__--'._/-' `
             |==|/    \==\;  ;\|  , \ \ / /L /::/ \,~~ |==|-|
             |//\\,__/== |: ;  |L_\  \ V / /L::/-__/  /=/-,|

quartata

@EasterlyIrk He means to read the code and input...

Easterly Irk

oh

quartata

also what is that supposed to be

Zgarb

Yeah, it can't access any files itself.

quartata

2:20 PM

it's terrifying

a goat mecha?

Easterly Irk

i think so

quartata

oh wait it's a bighorn sheep

crayzeedude

mecha sheep

Easterly Irk

^

eh

mechagoat sounds cooler than mechasheep

Other opinions on this suggested edit here? I declined it as superfluous.

Dennis

@Zgarb Could I run it as runhaskell grime.hs code inputor do you need STDIN as well?

@Zgarb Do you happen to know which packages I'd need on Ubuntu?

Zgarb

2:29 PM

@Dennis No need for STDIN. Also, you may want to compile it for better performance.

@Dennis I think ghc should be enough.

Dennis

Compilation is done with ghc? Total Haskell noob here...

Zgarb

@Dennis Yes, that's Glasgow Haskell Compiler.

Easterly Irk

A lot of the answers on this question use a builtin quine command. Is that disallowed as part of the default loopholes?

Zgarb

Then you run ghc -O2 grime to compile with optimizations.

Easterly Irk

It isn't a quine challenge, but similar.

Zgarb

2:33 PM

And it produces an executable.

No wait, make that ghc -O2 grime.hs

I haven't compiled Haskell in a while...

PhiNotPi

Idea: reverse king-of-the-hill. The entrants are provided, you must write the game.

zyabin101

@PhiNotPi Two bots each holding a signpost which can display any four-digit number from 0000 to 9999.

Easterly Irk

I like that idea.

Dennis

@Zgarb Needed libghc-parsec3-dev as well. Do you have anything handy I could use to test it?

PhiNotPi

There's a couple ways to do this:

1) the bots do something simple (output a number), and I have a large number of bots that do dozens of different strategies (always high/medium/low/alternate/etc.) Then, it's up to the controller to give meaning to it all.

2) I create a complete KOTH by myself, but keep the original controller/spec a secret, only releasing the bots.

Easterly Irk

2:43 PM

Maybe 2 posts like a C&R post, bots and controllers go on different pages?

Like you can start with a couple bots, and people take the info and do stuff with it?

TimmyD

The first one sounds like a real easy way to assume favoritism -- you could just program a controller that happens to make X person win.

PhiNotPi

3) Create general-game-playing AIs that can learn strategies based on the game rules that are provided to it, giving more freedom to the users to create a controller.

TimmyD

As unpopular as they are, #2 could easily become a pop-con

PhiNotPi

4) Cops-and-robbers, with general-game-playing bots on one side and controllers on the other

Zgarb

@Dennis Put d{2} in the grammar file, and something containing a 2x2 sub-rectangle of digits in the pattern file. It should find and print the digit rectangle.

Dennis

2:48 PM

Like this? It says grime: grime.hs:(254,36)-(256,28): Non-exhaustive patterns in case.

Lembik

@Maltysen in pypy it only takes 10 seconds with n= 9 !

Nathan Merrill

can you find the pentagon:

pub.ist.ac.at/~edels/hexasphere

2

@PhiNotPi I've already done this. It was a massive project using temporal difference learning, and learning was slow, but it worked

Zgarb

@Dennis Huh? That's not supposed to happen. Let me check...

Nathan Merrill

it actually didn't parse the rules, but took the current game state, and learned what good states were and bad states were

Zgarb

@Dennis Okay, it's complaining that you gave it the wrong number of command line arguments.

Dennis

2:51 PM

>.< Just a sec.

Zgarb

(Maybe the error message should be clearer...)

New Main Posts

7

Q: Snakify a String

A snakified string looks like this: T AnE eOf ifi ing h s x l A k e r isI amp Sna dSt Your Task Take a string s and a size n, then output the snakified string. The inputs ThisIsAnExampleOfaSnakifiedString and 3 would produce the example above. Specifications s will only contain ASCII chara...

code-golf string ascii-art

Dennis

@Zgarb \o/

Zgarb

Wohoo!

BTW, can you make the debug option give the -d flag to it?

Dennis

If -d prints to STDERR, I can just enable it permanently.

orlp

2:54 PM

6

Zgarb

@Dennis I think it just prints extra stuff to STDOUT.

Dennis

It does. ._.

Zgarb

Oh well, you can also set it from within the program.

trichoplax

@PhiNotPi Would the competing controllers be scored by how well they distinguish the bots? So the worst controllers would have all the bots scoring similarly, and the best controllers would have a clearly defined leaderboard with few ties or overlaps?

Dennis

@Zgarb Or with CLAs. grime.tryitonline.net/…

Zgarb

2:57 PM

Ooh, that's nice.

But anyway, thanks a lot!

trichoplax

@NathanMerrill @MartinBüttner may be interested in this for its potential applications in computer graphics

Nathan Merrill

its an april fools, apparently there's a pentagon in it, but I can't find it

PhiNotPi

@trichoplax I'm trying to think of a way to score them other than popcon. Ideally, the game (that the users create) should follow the "simple to learn, difficult to master" principle.

trichoplax

@NathanMerrill Don't look too hard... If there were any pentagons there would be 12 of them, so if you can't spot one fairly quickly it's almost certain there aren't any.

Katenkyo

I now can create tag synonyms! which mean I can say that alex-is-wrong and alex-is-not-right are alike :D

trichoplax

3:02 PM

You're not wrong

Easterly Irk

^

@Katenkyo you also need to have a +5 answer score in that tag however.

Katenkyo

@EasterlyIrk I wonder what analex-is-wrong challenge would look like...

PhiNotPi

@NathanMerrill I'm guessing that they're faking it by taking a regular sheet of hexagons and applying some visual distortion to it, to make it look spherical.

trichoplax

@NathanMerrill It's a double April fool - first tricking us into thinking it's possible to tile the sphere with hexagons, and then tricking us into looking for the counterexample on a sphere that isn't really a sphere. It's a work of art :)

Easterly Irk

@Katenkyo idk

Maybe check if a user if alex?

@AlexA. twitter.com/dog_rates

They rate dogs.

Rainbolt

3:10 PM

Lol. This guy at my office thinks he got an amazing deal on a printer. I pointed out that the toner costs more than the printer itself, and that the comparable Dell costs more but the toner is half as much. He went off and found a great deal on toner, and then I pointed out that the cartidge yield was 1000 pages compared to the 5000 page yield I quoted him. It feels good to be right so many times in one day.

Easterly Irk

rofl

also:

Oh. My. God. 13/10 magical af https://t.co/Ezu6jQrKAZ

Tweeted by dog_rates on March 20, 2016 at 11:23 PM

The link has a gif.

@CᴏɴᴏʀO'Bʀɪᴇɴ @CᴏɴᴏʀO'Bʀɪᴇɴ @CᴏɴᴏʀO'Bʀɪᴇɴ:

0

A: The plus-minus sequence

Fuzzy Octo Guacamole, 17 bytes (non-competing, uses features later than the challenge) ^^:(C.Zs.aZ.s.-:) This was hard to make, due to client-side errors. But I got it! Walkthrough: ^^ # Get input twice, pushes it to the stack. : # Prints the stack, and since ...

I got it in FOG. \o/

@CᴏɴᴏʀO'Bʀɪᴇɴ done.

Downgoat

@EasterlyIrk is it a rickroll?

zyabin101

@Downgoat Nope.

Verified by #83.

Downgoat

3:25 PM

@EasterlyIrk 8/10 not upsidedown

Neil

@EasterlyIrk Why doesn't ^^(:C.Zs.aZ.s.-) work? (Or maybe it does?)

Martin Büttner

@trichoplax thanks, I already found that somewhere on the weekend :)

@TimmyD we've converted ~50% of the bytes into insanity

trichoplax

@MartinBüttner I spun the sphere quite a bit before noticing the date... :)

Downgoat

@MarsUltor any idea why CheddarExperessionToken isn't returning anything?

Nathan Merrill

how would you preoptimize a graph so that finding the length of the path between two nodes is as fast as possible?

storing a map of every possible node pairing is prohibitively large

TimmyD

3:34 PM

@MartinBüttner Wow, really collapsed the loops.

Sp3000

Using #. to output so that we only needed to drag one element instead of two was all Martin's idea

trichoplax

@NathanMerrill Would it help to store closest node for each node?

Nathan Merrill

paths all have a cost of 1

so all neighbors are the "closest"

trichoplax

ah OK

What about storing the neighbour with the highest number of neighbours for each node?

TimmyD

@NathanMerrill Maybe storing how many neighbors each node has?

Ninja'd

Nathan Merrill

3:40 PM

how would that help?

zyabin101

> Experession

trichoplax

No idea :)

Nathan Merrill

simply select the "high neighbor" firsT?

you are more likely to find him, maybe?

TimmyD

It's a higher probability of getting you closer.

trichoplax

It would only help for a heuristic as far as I can see - it wouldn't guarantee anything

TimmyD

3:41 PM

Right

Nathan Merrill

right, but you have to search more paths on the neighbor with more paths

trichoplax

Good point

Optimizer

.

^ that?

trichoplax

That one's not so good. It's OK though

To me that's a full stop/period rather than a point, which would be floating half way up the line

TimmyD

anOKpoint

Sp3000

3:42 PM

Roughly how much data can we store anyway? Can we do, say, store one edge for each pair of nodes?

trichoplax

@NathanMerrill Could you store some data for each node on what proportion of the graph is accessible via each neighbour without passing through the current node again?

Nathan Merrill

I'm not sure how that data would like

trichoplax

Does the graph have lots of loops? It's not a tree?

Nathan Merrill

yes

if you're looking for a more concrete example, consider linkedin. They post how many degrees of separation you are to person A

the graph is connected with lots of cycles

TimmyD

Are you looking for the shortest path?

Nathan Merrill

3:46 PM

yes

but only the length, not necessarily the path

Zgarb

@NathanMerrill Do you need to process a lot of paths that have the same destination, or few different destinations?

Nathan Merrill

I can't make any assumptions about the destination or starting point

between any two nodes

Zgarb

Okay.

trichoplax

If you only need the length, and not the nodes in the path, does that simplify it? I can't quite think how but it seems like it should

Nathan Merrill

I'm not sure either, but it could make a difference

trichoplax

3:49 PM

If you have some nodes that have a huge number of neighbours (like Erdos or Bacon), then you can get a reasonable upper bound on the path length by adding the Erdos/Bacon number of the two nodes

Martin Büttner

is your graph undirected?

Nathan Merrill

yes

Zgarb

Maybe you could identify a small number of "central nodes", such that for all nodes that are far enough away from each other, there is an optimal path between them that goes through a central node. Then you could store the optimal paths to the central nodes.

That may depend heavily on your graph though.

Nathan Merrill

yeah, that depends on a graph with a low connectivity

Martin Büttner

do you know/can you determine the graph's diameter?

Nathan Merrill

3:51 PM

yes

orlp

@Dennis do you have any place where to read up on these 'chains' that Jelly uses?

Nathan Merrill

I guess with linked-in, you could get loose groupings of people

Martin Büttner

@orlp the github wiki has a tutorial

orlp

like, is it a standard notation/concept?

or your own creation?

@MartinBüttner I'm more specifically interested in it's concept/grounds than Jelly's specifics

Zgarb

@NathanMerrill Well, if you have a graph with high connectivity, then most paths are short anyway.

Martin Büttner

3:52 PM

@Zgarb right, but a BFS will then also have a massive branching factor

orlp

@MartinBüttner to give an analogue, I'm not asking about Pyth, I'm asking about prefix notation

Dennis

@orlp I took J's and APL's trains and changed their name. jsoftware.com/help/learning/09.htm

TimmyD

I mean, essentially, you're wanting the results of Dijkstra's algorithm pre-populated for every vertex.

Dennis

They are a little more useful in Jelly, since all built-ins have a fixed arity, so I can define more types of chains.

Nathan Merrill

not necessarily prepopulated, but yeah, more efficient

Martin Büttner

3:56 PM

(I've gotta say, I'm really enjoying the on-topic-ness in here...)

Nathan Merrill

oooh, lets say you define loose groupings of people

and you find the shortest path between these groups

no, that won't work.

Martin Büttner

how do you group them? pick a random person, group all people that can be reached in two steps, repeat?

orlp

what are you guys babbling about?

Martin Büttner

25 mins ago, by Nathan Merrill

how would you preoptimize a graph so that finding the length of the path between two nodes is as fast as possible?

TimmyD

Is there a faster algorithm than WFI for all-pairs?

orlp

3:58 PM

O(n^2) lookup table?

trichoplax

@NathanMerrill If you can identify bottlenecks that could work - depends on your graph.

Martin Büttner

25 mins ago, by Nathan Merrill

storing a map of every possible node pairing is prohibitively large

Nathan Merrill

does anybody know how wolfram alpha does the friend grouping here:

wolframalpha.com/input/…

Transcript for