Changeset 36362 in osm for applications/editors/josm/plugins/utilsplugin2/src/edu

Timestamp:

2025-01-02T14:16:53+01:00 (3 months ago)

Author:

stoecker

Message:

see #23688, patch for local URL calling

Location:

applications/editors/josm/plugins/utilsplugin2/src/edu/princeton/cs/algs4

Files:

• Bag.java (modified) (1 diff)
• EdgeWeightedDigraph.java (modified) (3 diffs)
• IndexMinPQ.java (modified) (1 diff)
• Stack.java (modified) (2 diffs)

applications/editors/josm/plugins/utilsplugin2/src/edu/princeton/cs/algs4/Bag.java

@@ -2 +2 @@
 package edu.princeton.cs.algs4;
 
-/*************************************************************************
+/* ************************************************************************
  *  Compilation:  javac Bag.java
  *  Execution:    java Bag < input.txt

applications/editors/josm/plugins/utilsplugin2/src/edu/princeton/cs/algs4/EdgeWeightedDigraph.java

@@ -103 +103 @@
      * Add the edge e to this digraph.
      */
-    public void addEdge(DirectedEdge e) {
-        int v = e.from();
-        adj[v].add(e);
+    public void addEdge(DirectedEdge ed) {
+        int v = ed.from();
+        adj[v].add(ed);
         E++;
     }
 
     /**
-     * Return the edges leaving vertex v as an Iterable.
-     * To iterate over the edges leaving vertex v, use foreach notation:
-     * <tt>for (DirectedEdge e : graph.adj(v))</tt>.
+     * Return the edges leaving vertex ve as an Iterable.
+     * To iterate over the edges leaving vertex ve, use foreach notation:
+     * <tt>for (DirectedEdge e : graph.adj(ve))</tt>.
      */
-    public Iterable<DirectedEdge> adj(int v) {
-        return adj[v];
+    public Iterable<DirectedEdge> adj(int ve) {
+        return adj[ve];
     }
 
@@ -125 +125 @@
     public Iterable<DirectedEdge> edges() {
         Bag<DirectedEdge> list = new Bag<>();
-        for (int v = 0; v < V; v++) {
-            for (DirectedEdge e : adj(v)) {
-                list.add(e);
+        for (int ve = 0; ve < V; ve++) {
+            for (DirectedEdge ed : adj(ve)) {
+                list.add(ed);
             }
         }
@@ -134 +134 @@
 
     /**
-     * Return number of edges leaving v.
+     * Return number of edges leaving ve.
      */
-    public int outdegree(int v) {
-        return adj[v].size();
+    public int outdegree(int ve) {
+        return adj[ve].size();
     }
 

applications/editors/josm/plugins/utilsplugin2/src/edu/princeton/cs/algs4/IndexMinPQ.java

@@ -2 +2 @@
 package edu.princeton.cs.algs4;
 
-/*************************************************************************
+/* ************************************************************************
  *  Compilation:  javac IndexMinPQ.java
  *  Execution:    java IndexMinPQ

applications/editors/josm/plugins/utilsplugin2/src/edu/princeton/cs/algs4/Stack.java

@@ -2 +2 @@
 package edu.princeton.cs.algs4;
 
-/*************************************************************************
+/* ************************************************************************
  *  Compilation:  javac Stack.java
  *  Execution:    java Stack < input.txt
@@ -160 +160 @@
 
 
-    /**
-     * A test client.
-     */
+    ///**
+    // * A test client.
+    // */
     //    public static void main(String[] args) {
     //        Stack<String> s = new Stack<String>();