News for hackers. Stuff that matters.
Re:U.S. regulators accuse Palantir of bias against Asians by dastbe on Tuesday September 27, 2016 @01:31AM (#12587627)
Do you give them a graph data structure or something that is explicitly a tree?
Re:U.S. regulators accuse Palantir of bias against Asians by dnautics on Tuesday September 27, 2016 @08:48AM (#12589180)
A acyclic graph is isomorphic to a tree, but the way you access the vertices and edges is completely different.
Re:U.S. regulators accuse Palantir of bias against Asians by palunon on Tuesday September 27, 2016 @10:08AM (#12589668)
Depends on your memory representation of the graph. If you simply use the obvious one (a node have a list of pointers to its successors), I don't see the difference except for successors[]/children[]
Re:U.S. regulators accuse Palantir of bias against Asians by dnautics on Wednesday September 28, 2016 @06:14AM (#12596562)
You're right. I mentioned acyclic graph and my mind slipped to general graphs. Although often graphs are represented as say a sparse matrix.