qq410328702
发表于 2019-12-4 01:29:16
public void onOpen(Session session, @PathParam(value="username") String username) {
this.session = session;
User user = new User();
UserServiceImpl impl=new UserServiceImpl();
user.setUsername(username);
this.user = impl.queryUserWithUserName(username);
user.setPassword(null);
connectedUsers.add(this);
sendNotifyMessage();
System.out.println(user.getUsername() + "上线!");
} public void onOpen(Session session, @PathParam(value="username") String username) {
this.session = session;
User user = new User();
UserServiceImpl impl=new UserServiceImpl();
user.setUsername(username);
this.user = impl.queryUserWithUserName(username);
user.setPassword(null);
connectedUsers.add(this);
sendNotifyMessage();
System.out.println(user.getUsername() + "上线!");
} public void onOpen(Session session, @PathParam(value="username") String username) {
this.session = session;
User user = new User();
UserServiceImpl impl=new UserServiceImpl();
user.setUsername(username);
this.user = impl.queryUserWithUserName(username);
user.setPassword(null);
connectedUsers.add(this);
sendNotifyMessage();
System.out.println(user.getUsername() + "上线!");
}
qq410328702
发表于 2019-12-19 00:56:24
{visited=1;
for(p=G.vertices.firstarc;p;p=p->nextarc)
{l=p->adjvex;
if(!visited)
if(exist_path_len(G,l,j,k-1)) return 1; //剩余路径长度减一
}//for
visited=0; //本题允许曾经被访问过的结点出现在另一条路径中
}//else
return 0; //没找到
}//exist_path_len {visited=1;
for(p=G.vertices.firstarc;p;p=p->nextarc)
{l=p->adjvex;
if(!visited)
if(exist_path_len(G,l,j,k-1)) return 1; //剩余路径长度减一
}//for
visited=0; //本题允许曾经被访问过的结点出现在另一条路径中
}//else
return 0; //没找到
}//exist_path_len {visited=1;
for(p=G.vertices.firstarc;p;p=p->nextarc)
{l=p->adjvex;
if(!visited)
if(exist_path_len(G,l,j,k-1)) return 1; //剩余路径长度减一
}//for
visited=0; //本题允许曾经被访问过的结点出现在另一条路径中
}//else
return 0; //没找到
}//exist_path_len