Re: optimal way in graph?

want to find a way from a start vertice to visit the other vertices in
a graph.
constraints:
1. a way with min. edges

This is called minimum spanning tree.

2. need not to visit all the vertices of this graph, but the unvisit
vertices should have max. 2 edges to one of the visited vertices on
this way

I don't understand your explanation here. Would you provide an example.

--
Bernd

.

Relevant Pages