Java graphs Breadth first

Question

how do I implement these methods in a Java Breadth first graph while using Queues?

An add method which adds a new vertex into the graph without any edges?

How can I return the Adjacency matrix?

if it contains a Triangle?

Please do your own homework. :) – Ashley Frieze Nov 03 '16 at 00:00 — Ashley Frieze, Nov 03 '16 at 00:00
Please do your own google – Michael Markidis Nov 03 '16 at 00:07 — Michael Markidis, Nov 03 '16 at 00:07
Learn BFS first. You will get all your answers. – shakhawat Jan 15 '19 at 14:34 — shakhawat, Jan 15 '19 at 14:34

score 0 · Answer 1 · edited May 23 '17 at 12:19

0

Although I'm not sure what you're asking, you might want to take a look at this question and answer.

There you will find the description and implementation of a breadth-first search algorithm using Queue in Java.

edited May 23 '17 at 12:19

Community

answered Nov 03 '16 at 01:31

marcelovca90

1 Answers1