On Fri, May 20, 2022 at 5:08 PM Elijah Stone <elro...@elronnd.net> wrote:
> On Fri, 20 May 2022, Elijah Stone wrote:
> > I still don't know a more space-efficient representation for graphs than an
> > adjacency matrix.
>
> Sorry--I know of lots.  What I don't know is a time-efficient representation
> which is more space-efficient than adjacency matrices.

That's going to depend on a variety of details.

If you are replicating Dijkstra's algorithm for moderately connected
graphs, you do need operations which efficiently represent such graphs
in that context.

-- 
Raul
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm

Reply via email to