1

所以我正在尝试使用java在无向图中查找路径。我觉得我可能走在正确的轨道上，非常接近获得它，但是，我一直遇到路障并收到错误提示。我正在使用链表来存储边和顶点。

Graph2.java:17：错误：通用数组创建 adj = new LinkedList[v];

这是我的代码

import java.io.*;
import java.util.*;
import java.util.LinkedList;
import java.util.Scanner;

// This class represents a directed graph using adjacency list
// representation
class Graph2
{
    private int V;   // No. of vertices
    private LinkedList<Integer> adj[]; //Adjacency List

    //Constructor
    Graph2(int v)
    {
        V = v;
        adj = new LinkedList<Integer>[v];
        for (int i=0; i<v; ++i)
            adj[i] = new LinkedList<Integer>();
    }

    //Function to add an edge into the graph
    void addEdge(int v,int w)  {   adj[v].add(w);   }

    //prints BFS traversal from a given source s
    Boolean isReachable(int s, int d)
    {
        LinkedList<Integer>temp;

        // Mark all the vertices as not visited(By default set
        // as false)
        boolean visited[] = new boolean[V];

        // Create a queue for BFS
        LinkedList<Integer> queue = new LinkedList<Integer>();

        // Mark the current node as visited and enqueue it
        visited[s]=true;
        queue.add(s);

        // 'i' will be used to get all adjacent vertices of a vertex
        Iterator<Integer> i;
        while (queue.size()!=0)
        {
            // Dequeue a vertex from queue and print it
            s = queue.poll();

            int n;
            i = adj[s].listIterator();

            // Get all adjacent vertices of the dequeued vertex s
            // If a adjacent has not been visited, then mark it
            // visited and enqueue it
            while (i.hasNext())
            {
                n = i.next();
                System.out.println(n);
                // If this adjacent node is the destination node,
                // then return true
                if (n==d)
                    return true;

                // Else, continue to do BFS
                if (!visited[n])
                {
                    visited[n] = true;
                    queue.add(n);
                }
            }
        }

        // If BFS is complete without visited d
        return false;
    }

    // Driver method
    public static void main(String args[])
    {
        // Create a graph given in the above diagram
        Graph g = new Graph(9999999);
        try{
        File file = new File("Graph.txt");
        Scanner scan = new Scanner(file);
        while(scan.hasNextLine())
        {
            String [] tempArray = scan.nextLine().split(",");
            g.addEdge(Integer.parseInt(tempArray[0]), Integer.parseInt(tempArray[1]));
        }
        scan.close();
    }
    catch(FileNotFoundException fs)
    {

    }

        int u = 1;
        int v = 891950;
        if (g.isReachable(u, v))
            System.out.println("There is a path from " + u +" to " + v);
        else
            System.out.println("There is no path from " + u +" to " + v);;
    }
}
4

1 回答 1

0

声明这个变量的正确方法是：

private LinkedList<Integer> adj;

初始化：

adj = new LinkedList<Integer>();

要将元素放入此列表，您可以使用：

adj.add(index, element);

元素可能是 LinkedList 对象，但您应该在声明时将泛型类型更改为 LinkedList。在 Java文档
中阅读有关 LinkedList 的更多信息。

于 2017-10-22T05:47:15.313 回答