lemon/fredman_tarjan.h
changeset 2314 dbbd5c514163
parent 2260 4274224f8a7d
child 2391 14a343be7a5a
equal deleted inserted replaced
9:f5c625f88aa7 10:036b2e9148b7
   278       typedef typename SrcGraph::UEdge UEdge;
   278       typedef typename SrcGraph::UEdge UEdge;
   279       typedef typename SrcGraph::NodeIt NodeIt;
   279       typedef typename SrcGraph::NodeIt NodeIt;
   280       typedef typename SrcGraph::template NodeMap<int> HeapCrossRef;
   280       typedef typename SrcGraph::template NodeMap<int> HeapCrossRef;
   281       typedef typename SrcGraph::template NodeMap<UEdge> PredMap;
   281       typedef typename SrcGraph::template NodeMap<UEdge> PredMap;
   282       HeapCrossRef crossref(graph,-1);
   282       HeapCrossRef crossref(graph,-1);
   283       FibHeap<Node,Value,HeapCrossRef> heap(crossref);
   283       FibHeap<Value,HeapCrossRef> heap(crossref);
   284       PredMap pred(graph,INVALID);
   284       PredMap pred(graph,INVALID);
   285       int rate=2*edgenum/countNodes(graph);
   285       int rate=2*edgenum/countNodes(graph);
   286       int limit=(rate>std::numeric_limits<int>::digits)?
   286       int limit=(rate>std::numeric_limits<int>::digits)?
   287       std::numeric_limits<int>::max() : (1<<rate);
   287       std::numeric_limits<int>::max() : (1<<rate);
   288       for(NodeIt i(graph);i!=INVALID;++i){
   288       for(NodeIt i(graph);i!=INVALID;++i){