Examples of edu.uci.ics.jung.algorithms.shortestpath.DijkstraDistance$SourceData

Package edu.uci.ics.jung.algorithms.shortestpath

Examples of edu.uci.ics.jung.algorithms.shortestpath.DijkstraDistance$SourceData

edu.uci.ics.jung.algorithms.shortestpath.DijkstraDistance
For a given source vertex, holds the estimated and final distances, tentative and final assignments of incoming edges on the shortest path from the source vertex, and a priority queue (ordered by estimated distance) of the vertices for which distances are unknown. @author Joshua O'Madadhain

  }
  
  public static int diameter(LearnerGraph graph)
  {// TODO: to rewrite using a flowgraph or not, given that this is only used once per experiment? 
    DirectedSparseGraph g = graph.paths.getGraph();
    DijkstraDistance dd = new DijkstraDistance(g);
    Collection<Double> distances = dd.getDistanceMap(DeterministicDirectedSparseGraph.findInitial(g)).values();
    Double result =-1.;
    for(Double distance:distances) if (result<distance) result=distance;
    return result.intValue();
  }

View Full Code Here

  }
  
  @SuppressWarnings("unchecked")
  protected static int getEffectiveDiameter(DirectedSparseGraph machine)
  {
    DijkstraDistance p = new DijkstraDistance(machine);
    List<Integer> distances = new LinkedList<Integer>();


    for(DeterministicVertex v:(Set<DeterministicVertex>)machine.getVertices())
      for(DeterministicVertex vOther:(Set<DeterministicVertex>)machine.getVertices())
      {
        int length = 0;
        Number distance = p.getDistance(v, vOther);if (distance != null) length = distance.intValue();
        if (length > 0) // non-empty path
          distances.add(length);
        // cannot limit consideration to a triangular subset because the relation is not symmetric.
      }

View Full Code Here

  }
  
  @SuppressWarnings("unchecked")
  protected static int getEffectiveDiameter(DirectedSparseGraph machine)
  {
    DijkstraDistance p = new DijkstraDistance(machine);
    List<Integer> distances = new LinkedList<Integer>();
    for(DeterministicVertex v:(Set<DeterministicVertex>)machine.getVertices())
      for(DeterministicVertex vOther:(Set<DeterministicVertex>)machine.getVertices())
      {
        int length = 0;
        Number distance = p.getDistance(v, vOther);if (distance != null) length = distance.intValue();
        if (length > 0) // non-empty path
          distances.add(length);
        if (v == vOther)
          break;// we only process a triangular subset.
      }

View Full Code Here

  }
  
  public static int diameter(LearnerGraph graph)
  {// Decided not to rewrite using a flowgraph or not, given that this is only used once per experiment. 
    DirectedSparseGraph g = graph.pathroutines.getGraph();
    DijkstraDistance dd = new DijkstraDistance(g);
    Collection<Double> distances = dd.getDistanceMap(DeterministicDirectedSparseGraph.findInitial(g)).values();
    Double result =-1.;
    for(Double distance:distances) if (result<distance) result=distance;
    return result.intValue();
  }

View Full Code Here

    
  }
  
  protected static int getEffectiveDiameter(DirectedSparseGraph machine)
  {
    DijkstraDistance p = new DijkstraDistance(machine);
    List<Integer> distances = new LinkedList<Integer>();
    for(DeterministicVertex v:(Set<DeterministicVertex>)machine.getVertices())
      for(DeterministicVertex vOther:(Set<DeterministicVertex>)machine.getVertices())
      {
        int length = 0;
        Number distance = p.getDistance(v, vOther);if (distance != null) length = distance.intValue();
        if (length > 0) // non-empty path
          distances.add(length);
        if (v == vOther)
          break;// we only process a triangular subset.
      }

View Full Code Here

    
  }
  
  protected static int getEffectiveDiameter(DirectedSparseGraph machine)
  {
    DijkstraDistance p = new DijkstraDistance(machine);
    List<Integer> distances = new LinkedList<Integer>();
    for(DeterministicVertex v:(Set<DeterministicVertex>)machine.getVertices())
      for(DeterministicVertex vOther:(Set<DeterministicVertex>)machine.getVertices())
      {
        int length = 0;
        Number distance = p.getDistance(v, vOther);if (distance != null) length = distance.intValue();
        if (length > 0) // non-empty path
          distances.add(length);
        if (v == vOther)
          break;// we only process a triangular subset.
      }

View Full Code Here

  }
  
  public static int diameter(LearnerGraph graph)
  {// Decided not to rewrite using a flowgraph or not, given that this is only used once per experiment. 
    DirectedSparseGraph g = graph.pathroutines.getGraph();
    DijkstraDistance dd = new DijkstraDistance(g);
    @SuppressWarnings("unchecked")
    Collection<Double> distances = dd.getDistanceMap(DeterministicDirectedSparseGraph.findInitial(g)).values();
    Double result =-1.;
    for(Double distance:distances) if (result<distance) result=distance;
    return result.intValue();
  }

View Full Code Here

  }
  
  public static int diameter(LearnerGraph graph)
  {// Decided not to rewrite using a flowgraph or not, given that this is only used once per experiment. 
    DirectedSparseGraph g = graph.pathroutines.getGraph();
    DijkstraDistance dd = new DijkstraDistance(g);
    @SuppressWarnings("unchecked")
    Collection<Double> distances = dd.getDistanceMap(DeterministicDirectedSparseGraph.findInitial(g)).values();
    Double result =-1.;
    for(Double distance:distances) if (result<distance) result=distance;
    return result.intValue();
  }

View Full Code Here

    
  }
  
  protected static int getEffectiveDiameter(DirectedSparseGraph machine)
  {
    DijkstraDistance p = new DijkstraDistance(machine);
    List<Integer> distances = new LinkedList<Integer>();
    for(DeterministicVertex v:(Set<DeterministicVertex>)machine.getVertices())
      for(DeterministicVertex vOther:(Set<DeterministicVertex>)machine.getVertices())
      {
        int length = 0;
        Number distance = p.getDistance(v, vOther);if (distance != null) length = distance.intValue();
        if (length > 0) // non-empty path
          distances.add(length);
        if (v == vOther)
          break;// we only process a triangular subset.
      }

View Full Code Here

    
  }
  
  protected static int getEffectiveDiameter(DirectedSparseGraph machine)
  {
    DijkstraDistance p = new DijkstraDistance(machine);
    List<Integer> distances = new LinkedList<Integer>();
    for(DeterministicVertex v:(Set<DeterministicVertex>)machine.getVertices())
      for(DeterministicVertex vOther:(Set<DeterministicVertex>)machine.getVertices())
      {
        int length = 0;
        Number distance = p.getDistance(v, vOther);if (distance != null) length = distance.intValue();
        if (length > 0) // non-empty path
          distances.add(length);
        if (v == vOther)
          break;// we only process a triangular subset.
      }

View Full Code Here

0 1

TOP

Related Classes of edu.uci.ics.jung.algorithms.shortestpath.DijkstraDistance$SourceData

org.apache.commons.collections15.functors.ConstantTransformer

statechum.analysis.learning.experiments.ForestFireNDStateMachineGenerator

statechum.analysis.learning.experiments.ForestFireStateMachineGenerator

statechum.analysis.learning.experiments.RandomPathGenerator

statechum.analysis.learning.rpnicore.RandomPathGenerator

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.