Re: modified-- strongly connected components(SCC)?

Not better than O(V+E), but it will be helpful if I can reduce the
value of constants in O(V+E). In other words, if the graph contains
many-many virtex of object type "M", then maybe I can get a algorithm
O(V'+E), V' = (V - Count-of-all-objects-of-type-M).

-Amit

.

Relevant Pages

  • [Graph theory] Coloring a planar graph
    ... I'm going to do a program who let to detect if a graph is planar or no. ... I must find an algorithm using this properties. ... Prev by Date: ...
    (sci.math.research)
  • Re: Shortish paths
    ... For how many nodes and how many edges will the actual algorithm run ... original graph. ... optimal solution is removed from the graph, ... I intend to begin by rereading the shortest path sections of Cormen ...
    (comp.theory)
  • Re: Standard graph API?
    ... isomorphism graph library. ... It's pretty uniformly agreed that there is no standard graph ... the algorithm can't be specialized for the graph at ... My thought is to use some sort of templating system. ...
    (comp.lang.python)
  • Difference between two systems of DAGs
    ... I am looking for a graph algorithm, ... carry no label or other information except direction. ... edit operations are to change the label of a vertex or the ...
    (comp.theory)
  • Re: Vertex Cover implementation
    ... i code this simple greedy algorithm for the vertex cover: ... As you are constructing your graph you can update the vertex ... each edge appears on two adjacency lists. ... reason to use a priority queue for your algorithm. ...
    (comp.theory)