- html - 出于某种原因,IE8 对我的 Sass 文件中继承的 html5 CSS 不友好?
- JMeter 在响应断言中使用 span 标签的问题
- html - 在 :hover and :active? 上具有不同效果的 CSS 动画
- html - 相对于居中的 html 内容固定的 CSS 重复背景?
嗨,很棒的人!
我有一个问题...当我的测试用例到达 connectNodes 方法中的 allEdges.add(newEdge);
时,我收到 NullPointerException。
我认为它与之前相同方法中的Edge newEdge = new Edge( n1, n2, Weight );
有关。
问题是我在 Edge 类中使用泛型还是类似的东西?我之前在 Edge newEdge = new Edge( n1, n2, Weight );
行中收到错误提示,提示类似“未找到类”之类的内容。但现在我似乎在 allEdges.add(newEdge);
处得到了 NullPointerException 而没有更改任何内容。
非常感谢您的每一点帮助!
import java.util.*;
public class MyMiniGraph<T extends Comparable<? super T>> implements MiniGraph<T>
{
// The Graph containing all the nodes and their edges
private Map< T, HashSet<Edge> > theGraph = new HashMap< T, HashSet<Edge> >( );
// Keeps track of theGraphs current size
private int currentSize = 0;
// Keeps track of the current Edge quantity
private int numEdges;
// TreeSet containing all edges
private TreeSet<Edge> allEdges;
// edge representing class with its associated nodes and weight
private class Edge implements Comparable<Edge>
{
public int cost;
public T n1;
public T n2;
public Edge(T n1, T n2 , int cost)
{
this.n1 = n1;
this.n2 = n2;
this.cost = cost;
}
public int compareTo(Edge e)
{
// returns 0 if edges are equal
if(e.cost == cost)
return 0;
// returns 1 if edge is greater than other edge,
// -1 if edge is smaller than other edge
return e.cost < cost ? 1 : -1;
}
}
/**
* Method for adding a node to the graph.
* Silently ignores any duplicates
*
* @param n The node to add to the graph.
*/
public void addNode(T n)
{
if(n == null)
throw new IllegalStateException("Invalid Node");
if(!theGraph.containsKey(n))
{
theGraph.put(n,new HashSet<Edge>());
++currentSize;
}
}
/**
* Method for removing a node from the graph.
* Before the node is removed, all edges associated with the node
* must be removed.
* Silently ignores any nodes not already in the graph.
*/
public void removeNode(T n)
{
if(theGraph.containsKey(n))
{
// If node n has edges, remove all those edges.
// Firstly, remove the edges connecting to this
// node from other nodes, then, remove this node
// and its edges with it.
if( !theGraph.get(n).isEmpty() )
{
//iterator to iterate over the edges of node n
Iterator<Edge> edgeIt = theGraph.get(n).iterator();
// remove this node from all its connecting nodes edge lists
Edge localEdge;
/**Edge foreignEdge;*/
while(edgeIt.hasNext())
{
localEdge = edgeIt.next();
T foreignNode = localEdge.n2 == n ? localEdge.n1 : localEdge.n2;
// iterator to iterate over the edges of adjacent node of n (foreignNode)
/**Iterator<Edge> forEdgeIt =
theGraph.get(foreignNode).iterator();
while(forEdgeIt.hasNext())
{
foreignEdge = forEdgeIt.next();
if( foreignEdge.equals( localEdge ) )
forEdgeIt.remove();
}*/
// removes all edges occurring in n from all foreign nodes
theGraph.get(foreignNode).remove(localEdge);
allEdges.remove(localEdge);
--numEdges;
}
}
//remove the node itself thereby also removing its local edge list
theGraph.remove(n);
--currentSize;
}
}
/**
* Method for creating an unidirectional edge between two nodes.
*
* @param n1 The first node to create an edge between
* @param n2 The second node to create an edge between
* @param weight The cost for traversing the edge
*/
public void connectNodes(T n1, T n2, int weight)
{
if(!contains(n1) || !contains(n2))
throw new IllegalStateException("node not in graph");
if(!edgeExistsBetween(n1,n2))
{
Edge newEdge = new Edge( n1, n2, weight );
theGraph.get(n1).add( newEdge );
theGraph.get(n2).add( newEdge );
allEdges.add(newEdge);
++numEdges;
}
}
/**
* Method for removing an edge between two nodes.
*
* @param n1 The first node that identifies the edge.
* @param n2 The second node that identifies the edge.
*/
public void disconnectNodes(T n1, T n2)
{
if(!contains(n1) || !contains(n2))
throw new IllegalStateException("node not in graph");
boolean n1n2EdgeExists = true;
// iterates over n1, removing all edges containing n2 from n2
Iterator<Edge> edgeIt = theGraph.get(n1).iterator();
Edge deadEdge = null;
while(edgeIt.hasNext())
{
deadEdge = edgeIt.next();
if( deadEdge.n1.equals(n1) )
theGraph.get(n2).remove(deadEdge);
else if( deadEdge.n2.equals(n1) )
theGraph.get(n1).remove(deadEdge);
else
n1n2EdgeExists = false;
}
if(n1n2EdgeExists){
// removes the n1-n2 edge from n1
theGraph.get(n1).remove(deadEdge);
allEdges.remove(deadEdge);
--numEdges;
}
}
/**
* Method for searching the graph for a certain node.
* If the node is present in the graph, the method returns
* true, otherwise, it returns false.
*
* @return boolean true if the graph contains n, otherwise false.
*/
public boolean contains(T n)
{
return theGraph.containsKey(n);
}
/**
* Method for finding the number of nodes in the graph.
*
* @returns int The number of nodes in the graph.
*/
public int size()
{
return currentSize;
}
/**
* Checks if there exists and edge between nodes n1 and n2.
* Used for testing purposes.
*
* @param n1 The first node that identifies the edge.
* @param n2 The second node that identifies the edge.
* @return true if and edge exists between n1 and n2, otherwise false.
*/
public boolean edgeExistsBetween(T n1, T n2)
{
if(contains(n1))
{
boolean n1ContainsN2 = false;
Iterator<Edge> edgeIt = theGraph.get(n1).iterator();
Edge adjToN1;
while(edgeIt.hasNext())
{
adjToN1 = edgeIt.next();
if( adjToN1.n1.equals(n2) )
n1ContainsN2 = true;
else if( adjToN1.n2.equals(n2) )
n1ContainsN2 = true;
else
;
}// while n1 has next edge
return n1ContainsN2;
}// if n1 in graph
return false;
}
/**
* Gets the number of edges in the graph.
* Used for testing purposes.
*
* @return the number of edges in the graph.
*/
public int getNumberOfEdges()
{
return numEdges;
}
/**
* Method for calculating a minimum spanning tree for the graph.
* The method is supposed to returning a String representing the
* minimum spanning tree. The method is not allowed to modify the
* graph during the calculation, ie. the original graph must be
* identical to how the graph looked before the invocation of
* the method.
*
* The minimum spanning tree is calculated using Kruskal's algorithm.
*
* @return Graph A new instance of the Graph class, representing a
* minimal spanning tree.
*/
public MyMiniGraph<T> generateMinimumSpanningTree()
{
int edgesAccepted = 0;
//give all nodes to a class representing disjoint sets
DisjSet<T> ds = new DisjSet<T>( theGraph.keySet() );
//set up a new graph to represent the minimum spanning tree
MyMiniGraph<T> minSpanTree = new MyMiniGraph<T>();
//initialize minSpanTree with all theGraphs nodes
Iterator<T> nodeIter = theGraph.keySet().iterator();
while(nodeIter.hasNext())
minSpanTree.addNode(nodeIter.next());
//order all edges in theGraph in a priority queue
PriorityQueue<Edge> pq = new PriorityQueue<Edge>(allEdges);
Edge e;
// Kruskals algorithm. Accepts the smallest edges in order
// if they are not part of the same set which would cause a cycle.
while(edgesAccepted < currentSize -1)
{
e = pq.poll( );
T uset = ds.find( e.n1 );
T vset = ds.find( e.n2 );
if(uset != vset)
{
// Accept the edge
edgesAccepted++;
ds.union(uset, vset);
//if the edge is accepted, add it to minSpanTree
minSpanTree.connectNodes(e.n1, e.n2, e.cost);
}
}
return minSpanTree;
}
}
最佳答案
我没有找到任何将成员 allEdges 初始化为有效 TreeSet 对象的地方。尝试初始化(正确的位置似乎就是您定义的位置)
关于java - 实例化私有(private)类->空指针异常,我们在Stack Overflow上找到一个类似的问题: https://stackoverflow.com/questions/5134727/
有没有一种方法可以使用标准类型构造函数(例如 int、set、dict、list、tuple 等)以用户定义的方式将用户定义类的实例强制转换为其中一种类型?例如 class Example:
我知道这个问题在Stackoverflow中有很多问题,但是即使有很多答案,这些答案也帮不了我什么,也没有找到答案。 在我的WebAPP中,它可以正常工作,但是当我将其转换为API时,它失败了(主题标
这个问题已经有答案了: Why does the ternary operator unexpectedly cast integers? (3 个回答) 已关闭 9 年前。 最近遇到一个Java的陷
我尝试使用 FirebaseApp.configure() 配置 Firebase,但遇到以下崩溃: *** Terminating app due to uncaught exception 'c
我有一个自连接员工实体类,其中包含与其自身相关的 id、name 和 ref 列。我想创建它的新实例并将其保存到数据库。 首先我创建了一个 Employee 类的实例并将其命名为 manager。然后
我有一个用于添加新公寓的表单,在该表单中我有一个下拉列表,用户可以在其中选择负责的人员。 显然,当您从下拉列表中选择并尝试保存公寓时,我的应用程序认为该人已被修改。它给了我下面的错误,指示我应该首先保
从 Visualforce 页面,我需要检索我们组织的 salesforce 实例的 URL,而不是 Visual Force URL。 例如我需要https://cs1.salesforce.com
我遇到了一些可能的问题答案,但这是关于从 Hibernate 3.4.0GA 升级到 Hibernate 4.1.8 的问题。所以这曾经在以前的版本下工作,我已经四处搜索了为什么它在这个新版本中出现了
似乎一遍又一遍地问这个问题,我仍然找不到解决我问题的答案。我在下面有一个域模型。每个新创建或更新的“安全用户”都需要我确保其具有配置文件,如果没有,则创建一个新的配置文件并分配给它。 配置文件的要求相
我很难调试为什么 JPA 不级联我的 @ManyToMany 关系。我发现的所有答案都与缺少级联语句有关。但我确实拥有它们并且仍然得到: Caused by: org.hibernate.Transi
Play 服务 API 表明有一个叫做 Instance ID 的东西 但是,在 Android Studio 中包含以下内容后,我无法导入 InstanceID 类 compile "com.goo
我正在使用 Seam 框架。我有 2 个实体: 请求.java @Entity @Table(name = "SRV_REQUEST") public class Request { private
This question处理构建一个适当的Monad来自单子(monad)的实例,但仅在某些约束下 - 例如Set .诀窍是将其包装成 ContT ,它将约束推迟到包装/展开其值。 现在我想对 Ap
我正在尝试执行此查询: StringBuffer sb = new StringBuffer(); sb.append("select p from PointsEntity p " + "where
我试图了解是否可以更改我的 hibernate 配置并使用单个 MySQL 实例(而不是我当前拥有的多个 MySQL 实例): 我有一个使用 hibernate 的 Java 应用程序,与 2 个模式
我有一个选项卡滑动布局,其中包括四个选项卡,每个选项卡都有自己的布局和 fragment ,在我的主要 Activity 布局中,viewpager 参与更改选项卡。特定 View (选项卡)在应用程
我看到很多帖子声称他们正在运行 MySql 的 RDS 实例,但无法连接到该实例,但我没有运行 RDS。 我使用 EC2 实例来托管我的 WordPress 博客,该博客是使用 Web 平台安装程序安
因为我在我的 ec-2 实例上的 python 虚拟环境中运行应用程序( Airflow ),并且我想在同一个 ec2 实例上的默认 python 环境中运行命令,所以我认为 ssh 到我自己的实例更
这个问题已经有答案了: How to fix the Hibernate "object references an unsaved transient instance - save the tra
例子: run APP1 .. ... run APP1 ... run APP2 如何在 APP2 中对 Vue 说我需要调用 APP1?
我是一名优秀的程序员,十分优秀!