Would Photoshop help improve the look of my video? [was: New to this]
Not sure if I already posted this but would photoshop help imporve the look of my video?
http://www.youtube.com/watch?v=n94-fqYPHWc
I agree with Mylenium. Premiere Elements would be a better program for the post-production.
As for shooting, I would use a background, as those wall plates/outlets really draw the eye. A nice piece of dark grey, non-glossy fabric, like perhaps a velvet, could be taped over the wall, behind your subject. If possible, move the subject a bit farther from any background.
Do not be afraid of composing the subject more tightly, so that one sees more of them, and less background. Even with a "talking head" shot, you can get much tighter with the framing.
I would also go for a bit more controlled lighting on your subject. Even placing a white card, or sheet to one side, just to fill in the face, would be better. Just keep it out of the coverage of the camera. A piece of foamcore, or Gator-foam, would work well. Angle it to fill that side of the subject's face.
The audio was recorded in a fairly "hard," or "live" environment. If the mic is camera-mounted, think about hanging some soft fabric, in a V, behind the camera and operator. The camera would be in the apex of the V. A few quilts would work fine. That should help remove the slight echo of the room, and "soften" the sound a bit.
Good luck, and hope those ideas help.
Hunt
Similar Messages
-
Improving the look and feel of your application
Deal all java programmers
I have Frame at the moment that has a menu and displaying 2 images. The application looks very boring and dull at the moment. I am just wondering if there is a class,tool or function in java that can help improve the look and feel of your application and make it looks better and stand out.
All RegardsIf you're using Java 5.0, you might be interested in Synth:
http://www-106.ibm.com/developerworks/java/library/j-synth/ -
Help us improve the look and feel of our community
The BTCare Community Team needs your help!
We want to improve the layout of the forum and would like to get your thoughts and feedback.
Please complete this short questionnaire (it's very short, promise) to share your ideas on how we can improve the look and feel of our community.
Thanks,
Stephanie
Stephanie
BTCare Community Manager
If you like a post, or want to say thanks for a helpful answer, please click on the Ratings star on the left-hand side of the post. If someone answers your question correctly please let other members know by clicking on ’Mark as Accepted Solution’.BinaryBurnout wrote:
I am curious how I might go about implementing some of these other L&F's. Every time I try to use them like the following...
UIManager.setLookAndFeel("org.jvnet.substance.skin.SubstanceRavenGraphiteGlassLookAndFeel");I keep getting a java.lang.ClassNotFoundException: org.jvnet.substance.skin.SubstanceRavenGraphiteGlassLookAndFeel error. How might I go about fixing this?Make sure the according classes/ jars are on the classpath.
-Puce -
Why can't we get Adobe Photoshop help on the weekends. If I buy it I should be able to use it.
Why can't we get Adobe Photoshop help on the weekends. If I buy it I should be able to use it.
To all frustrated Photoshop users:
As has been pointed out, the Adobe Photoshop Forum is NOT staffed by Adobe employees (though a few engineers DO stop by, when they have the time), and we are but users, such as yourself. The difference is that many users here have decades of experience with Ps, and can often solve all sorts of issues, of a technical nature.
Ranting, and listing bad experiences with Adobe Technical Support (or Customer Support), will NOT reach Adobe - just other users, who might have also had negative experiences with Adobe T/S, but who are powerless to change anything, at a corporate level - also noted by others in this thread.
We, as users, have no access to any communications that you might have had with T/S - no phone logs, no case numbers, nothing. All that we have is what YOU provide us, regarding YOUR problem. In that vein, if you read this FAQ Entry, plus the one linked in Station_Two's Reply above, and clearly state YOUR problem with the program, someone will attempt to help you with it: http://forums.adobe.com/message/4587299#4587299
Please be patient, as we are all volunteers (even the Adobe engineers come here on their own time - it's most likely not part of their job descriptions), and drop by the forum, when we have a moment. Many users DO have "day jobs," and face client deadlines. They might not get by that often, and then with breaks in timing, that can extend for days. This is not a "live chat room," where "operators are standing by." However, with the number of contributing users here, it should not take too long, before someone DOES reply to your post. If they have questions, please answer them, to the best of your abilities, and do not hesitate to ask for clarifications, if you are not sure what they are asking, or where to obtain that information. Also, please be courteous, when replying to the users, who are donating their time - they get zero, beyond the satisfaction of helping other users get answers and solutions. If they DO help, which is likely, a simple "thank you," is the best that they can receive. If they DO help, please take a moment to let them know, and also use the "Correct," and "Helpful" buttons in the forum, to let Adobe Corporate know that you got help in the Adobe Forums - they DO count those numbers, though they do not monitor these forums.
Good luck, and many feel that the help FROM the Adobe products forums, is much better, than from Adobe Technical Support.
Hunt -
I just purchased a ipad 2 and have not sync it yet. I have an old pc and would like to move the itunes library account to a newer pc that I have. Can I move the library to the ipad and sync ipods to the ipad and/or move the library to the new pc?
Perhaps this web page will help: http://support.apple.com/kb/ht1229
But I must point out that leaving the iPhoto Library on the external is worth considering. Your internal drive would be better off without having to carry the photos.
When you booted with the external connected and you were asked for the library, did you try navigating to the Library in on the external drive? -
When I got my Ipod Touch 3 years ago, my mum set up an Apple ID in her name & email address. I have since got an Ipad & set up my own Apple ID. How can I update my Ipod to my Apple ID? I would like to sync the Ipad and Ipod, but cant get past this ID problem?
Hi AnnieAnneok,
Welcome to the Support Communities!
The articles below may be able to help you with this.
Click on the links to see more details and screenshots.
First, I would suggest you backup your iPod touch and transfer purchases to your computer:
iOS: How to back up and restore your content
http://support.apple.com/kb/HT1766
Confirm your Apple ID is set up and updated with the correct information:
Frequently asked questions about Apple ID
http://support.apple.com/kb/HT5622
Then, in Settings on your iPod touch, sign out of your iCloud Account and your iTunes Store account and sign back in with the correct Apple ID.
Using your Apple ID for Apple services
http://support.apple.com/kb/HT4895
Cheers,
Judy -
I can't sync the Not Afraid music video that I purchased this morning to my iPod Classic. It's frustrating because I have no issues syncing other videos and the rest of the album that this video came with synced just fine. Below is an image of what my screen looks like when I try to drag the video across to my iPod:
Please help!You can only sync with one iTunes library. If you sync with another one the iPod will be erased and its contents replaced with what is in the library of the second computer.
However, you can manage music among multiple computers. See:
Using iPhone, iPad, or iPod with multiple computers
BTW you posted in the iPod touch forum -
I am currently managing 20 iPads on a macbook. I would like to manage the same 20 iPads on a new macbook pro. I have logged into the iTunes account on the new machine and see our apps but not the devices. How do i get the devices to be shown on new comp?
Has anyone used apple cpnfigurator for this purpose?
-
Question
I just installed the new firefox for Mac OSX 10.6.8 and when I select an image on a site (right click and copy) and paste in Photoshop 5.5, the image lightens. It does not do this in Safari.Firefox, Safari, and PhotoShop each handle embedded color profiles differently. For an add-on that makes it easier to experiment with Firefox's color management options, you might be interested in: [https://addons.mozilla.org/en-US/firefox/addon/color-management/ Color Management :: Add-ons for Firefox]. I haven't tried it myself.
-
Can you explain when using keywords and addding them to various clips pressing ctrl and a number eg. 1 or 2 it simply closes down FCPX. Just to the dock as would the yellow -sign. I am new to this program having only used Final Cut Express 4 previously.
iMac (early 2009) 24in 2.93GHz 4GB 1066MHz DDR3 SDRAM (To be upgraded ot 8GB in the nextfew days) os x 10.7.2 Lion
Re: Why don't my arrows on the time line operate and allow me to move to the start and end of the timeline. Iam using the trial versionCheck System Preferences. I think Control-1 is used by something in the OS now. Switch it off. It's a major p[ain the way the OS is taking over more and more of the keyboard, allowing less options for application use.
-
I downloaded Adobe Acrobat X in 2010 and then a few years later I got a new computer and I would like to install the Adobe Acrobat X on my new computer but I cannot tell if I had more than one license and my Adobe account is not showing that I ever downloaded or ordered anything. Can you assist?
Download/install it from http://helpx.adobe.com/acrobat/kb/acrobat-downloads.html and activate it with your serial number.
-
My right ear headphones won’t work on my iphone 4s. I restored the iphone and set-up as new phone, this made the right ear headphone work fine. But as soon as I restored the iphone from back-up it stopped working. Pls help
Restore as New...
Redownload your Purchased and Free Apps using the Apple ID you Originally used...
iPhone User Guide
http://manuals.info.apple.com/en_US/iphone_user_guide.pdf -
I would need help with saving some eamil messages to a disk to unclutter my email. How can I do this please?
Thanks.
ElisabethOpen the email and then from the File menu select Save As Rich Text Format. That'll save it to open in TextEdit. If you want a pdf then open the email and do command-p (Print) and then from the PDF drop down box lower left corner select Save as PDF.
-
I have this file but I need to improve the code on some method. The methods are addNode, deleteNode, saveNode, findLader and are they anyway for me to iliminate the findsmallest method?
here is the code
import java.io.*;
import java.util.LinkedList;
import java.util.Stack;
import javax.swing.*;
public class Graph {
private LinkedList graph;
private BufferedReader inputFile;
public Graph() {
graph = new LinkedList();
// read the words from the given file
// create a GraphNode
// Add the node to the graph
public void createGraph(String fileName) throws IOException {
inputFile = new BufferedReader(
new InputStreamReader(new FileInputStream("word.txt")));
// Convert the linkedlist to an array 'a'
// sort the array 'a'
// create a string from all elements in 'a'
// return the string
public String printGraph() {
String output = new String();
// will contain String objects
// ... do some work with the list, adding, removing String objects
String[] a = new String[graph.size()];
graph.toArray(a);
// now stringArray contains all the element from linkedList
quickSort(a, 0, a.size() - 1);
for(int i=0;i<a.length;++i)
output = output + new String(a.toString())+"\n";
return output;
private static void quickSort(Comparable[] theArray,
int first, int last) {
// Sorts the items in an array into ascending order.
// Precondition: theArray[first..last] is an array.
// Postcondition: theArray[first..last] is sorted.
// Calls: partition.
int pivotIndex;
if (first < last) {
// create the partition: S1, Pivot, S2
pivotIndex = partition(theArray, first, last);
// sort regions S1 and S2
quickSort(theArray, first, pivotIndex-1);
quickSort(theArray, pivotIndex+1, last);
} // end if
} // end quickSort
private static int partition(Comparable[] theArray,
int first, int last) {
// Partitions an array for quicksort.
// Precondition: theArray[first..last] is an array;
// first <= last.
// Postcondition: Returns the index of the pivot element of
// theArray[first..last]. Upon completion of the method,
// this will be the index value lastS1 such that
// S1 = theArray[first..lastS1-1] < pivot
// theArray[lastS1] == pivot
// S2 = theArray[lastS1+1..last] >= pivot
// Calls: choosePivot.
// tempItem is used to swap elements in the array
Comparable tempItem;
// place pivot in theArray[first]
//choosePivot(theArray, first, last);
Comparable pivot = theArray[first]; // reference pivot
// initially, everything but pivot is in unknown
int lastS1 = first; // index of last item in S1
// move one item at a time until unknown region is empty
for (int firstUnknown = first + 1; firstUnknown <= last;
++firstUnknown) {
// Invariant: theArray[first+1..lastS1] < pivot
// theArray[lastS1+1..firstUnknown-1] >= pivot
// move item from unknown to proper region
if (theArray[firstUnknown].compareTo(pivot) < 0) {
// item from unknown belongs in S1
++lastS1;
tempItem = theArray[firstUnknown];
theArray[firstUnknown] = theArray[lastS1];
theArray[lastS1] = tempItem;
} // end if
// else item from unknown belongs in S2
} // end for
// place pivot in proper position and mark its location
tempItem = theArray[first];
theArray[first] = theArray[lastS1];
theArray[lastS1] = tempItem;
return lastS1;
} // end partition
// Given a new word, add it to the graph
public void addNode(String word) {
GraphNode node = new GraphNode(word);
if(graph.contains(node)){
JOptionPane.showMessageDialog(null,"Duplicate Word, operation terminated");
for(int i=0; i<graph.size(); ++i) {
if(isAnEdge((String)(((GraphNode)graph.get(i)).getVertex()),(String)(node.getVertex()))) {
EdgeNode e1 = new EdgeNode((String)node.getVertex(),1);
EdgeNode e2 = new EdgeNode((String)((GraphNode)graph.get(i)).getVertex(),1);
node.addEdge(e2);
((GraphNode)graph.get(i)).addEdge(e1);
graph.add(node);
public boolean deleteNode(String word) {
GraphNode node = new GraphNode(word);
EdgeNode n = new EdgeNode(word,1);
if(!graph.contains(node)) {
return false;
else {
for(int i=0; i<graph.size();++i) {
((GraphNode)graph.get(i)).getEdgeList().remove(n);
graph.remove(node);
return true;
public void save(String fileName) {
try {
PrintWriter output = new PrintWriter(new FileWriter("word.txt"));
for(int i=0; i< graph.size();++i) {
output.println(((GraphNode)graph.get(i)).getVertex());
output.close();
catch (IOException e) {
// given two word, find the ladder (using dijkstra's algorithm
// create a string for the ladder and return it
public String findLadder(String start,String end) {
String ladder = new String();
GraphNode sv = new GraphNode(start);
GraphNode ev = new GraphNode(end);
if(!graph.contains(sv)) {
JOptionPane.showMessageDialog(null,start + " not in graph");
return null;
if(!graph.contains(ev)) {
JOptionPane.showMessageDialog(null,end + " not in graph");
return null;
LinkedList distance = new LinkedList(((GraphNode)graph.get(graph.indexOf(sv))).getEdgeList());
LinkedList visited = new LinkedList();
visited.add(start);
LinkedList path = new LinkedList();
path.add(new PathNode(start,"****"));
for(int i=0; i<distance.size();++i) {
PathNode p = new PathNode((String)((EdgeNode)distance.get(i)).getKey(),start);
path.add(p);
while(!visited.contains(end)) {
EdgeNode min = findSmallest(distance,visited);
String v = (String)min.getVertex();
if(v.equals("****"))
return null;
visited.add(v);
// for(int i=0;i<graph.size();++i) {
// String u = (String)(((GraphNode)(graph.get(i))).getVertex());
GraphNode temp1 = new GraphNode(v);
int index = graph.indexOf(temp1);
LinkedList l = new LinkedList(((GraphNode)graph.get(index)).getEdgeList());
for(int i=0;i<l.size();++i)
String u = (String)(((EdgeNode)(l.get(i))).getVertex());
if(!visited.contains(u)) {
int du=999, dv=999, avu=999;
dv = min.getCost();
EdgeNode edge = new EdgeNode(u,1);
if(distance.contains(edge)) {
du = ((EdgeNode)(distance.get(distance.indexOf(edge)))).getCost();
GraphNode temp = new GraphNode(v);
GraphNode node = ((GraphNode)(graph.get(graph.indexOf(temp))));
LinkedList edges = node.getEdgeList();
if(edges.contains(edge)) {
avu = ((EdgeNode)(edges.get(edges.indexOf(new EdgeNode(u,1))))).getCost();
if( du > dv+avu) {
if(du == 999) {
distance.add(new EdgeNode(u,dv+avu));
path.add(new PathNode(u,v));
else {
((EdgeNode)(distance.get(distance.indexOf(u)))).setCost(dv+avu);
((PathNode)(path.get(path.indexOf(u)))).setEnd(v);
if(!path.contains(new PathNode(end,"")))
return null;
LinkedList pathList = new LinkedList();
for(int i=0;i<path.size();++i) {
PathNode n = (PathNode)path.get(path.indexOf(new PathNode(end,"****")));
if(n.getEnd().compareTo("****") != 0) {
pathList.addFirst(end);
n = (PathNode)path.get(path.indexOf(new PathNode(n.getEnd(),"****")));
end = n.getStart();
pathList.addFirst(start);
for(int i=0;i<pathList.size()-1;++i) {
ladder = ladder + ((String)(pathList.get(i))) + " --> ";
ladder = ladder + ((String)(pathList.get(pathList.size()-1)));
return ladder;
private EdgeNode findSmallest(LinkedList distance, LinkedList visited) {
EdgeNode min = new EdgeNode("****",999);
for(int i=0;i<distance.size();++i) {
String node = (String)(((EdgeNode)distance.get(i)).getVertex());
if(!visited.contains(node)) {
if(((EdgeNode)distance.get(i)).getCost()<min.getCost()) {
min = (EdgeNode)distance.get(i);
return min;
// class that represents nodes inserted into path set
private class PathNode {
protected String sv;
protected String ev;
public PathNode(String s,String e) {
sv = s;
ev = e;
public String getEnd() {
return ev;
public String getStart() {
return sv;
public void setEnd(String n) {
ev = n;
public boolean equals(Object o) {
return this.sv.equals(((PathNode)o).sv);
public String toString() {
return "("+sv+":"+ev+")";
thank youlet me fix my misstake which was point out by some one in here and thank you ofr do so because I'm new at this.
I have this file but I need to improve the code on some method. The methods are addNode, deleteNode, saveNode, findLader and are they anyway for me to iliminate the findsmallest method?
here is the code
import java.io.*;
import java.util.LinkedList;
import java.util.Stack;
import javax.swing.*;
public class Graph {
private LinkedList graph;
private BufferedReader inputFile;
public Graph() {
graph = new LinkedList();
// read the words from the given file
// create a GraphNode
// Add the node to the graph
public void createGraph(String fileName) throws IOException {
inputFile = new BufferedReader(
new InputStreamReader(new FileInputStream("word.txt")));
// Convert the linkedlist to an array 'a'
// sort the array 'a'
// create a string from all elements in 'a'
// return the string
public String printGraph() {
String output = new String();
// will contain String objects
// ... do some work with the list, adding, removing String objects
String[] a = new String[graph.size()];
graph.toArray(a);
// now stringArray contains all the element from linkedList
quickSort(a, 0, a.size() - 1);
for(int i=0;i<a.length;++i)
output = output + new String(a.toString())+"\n";
return output;
private static void quickSort(Comparable[] theArray,
int first, int last) {
// Sorts the items in an array into ascending order.
// Precondition: theArray[first..last] is an array.
// Postcondition: theArray[first..last] is sorted.
// Calls: partition.
int pivotIndex;
if (first < last) {
// create the partition: S1, Pivot, S2
pivotIndex = partition(theArray, first, last);
// sort regions S1 and S2
quickSort(theArray, first, pivotIndex-1);
quickSort(theArray, pivotIndex+1, last);
} // end if
} // end quickSort
private static int partition(Comparable[] theArray,
int first, int last) {
// Partitions an array for quicksort.
// Precondition: theArray[first..last] is an array;
// first <= last.
// Postcondition: Returns the index of the pivot element of
// theArray[first..last]. Upon completion of the method,
// this will be the index value lastS1 such that
// S1 = theArray[first..lastS1-1] < pivot
// theArray[lastS1] == pivot
// S2 = theArray[lastS1+1..last] >= pivot
// Calls: choosePivot.
// tempItem is used to swap elements in the array
Comparable tempItem;
// place pivot in theArray[first]
//choosePivot(theArray, first, last);
Comparable pivot = theArray[first]; // reference pivot
// initially, everything but pivot is in unknown
int lastS1 = first; // index of last item in S1
// move one item at a time until unknown region is empty
for (int firstUnknown = first + 1; firstUnknown <= last;
++firstUnknown) {
// Invariant: theArray[first+1..lastS1] < pivot
// theArray[lastS1+1..firstUnknown-1] >= pivot
// move item from unknown to proper region
if (theArray[firstUnknown].compareTo(pivot) < 0) {
// item from unknown belongs in S1
++lastS1;
tempItem = theArray[firstUnknown];
theArray[firstUnknown] = theArray[lastS1];
theArray[lastS1] = tempItem;
} // end if
// else item from unknown belongs in S2
} // end for
// place pivot in proper position and mark its location
tempItem = theArray[first];
theArray[first] = theArray[lastS1];
theArray[lastS1] = tempItem;
return lastS1;
} // end partition
// Given a new word, add it to the graph
public void addNode(String word) {
GraphNode node = new GraphNode(word);
if(graph.contains(node)){
JOptionPane.showMessageDialog(null,"Duplicate Word, operation terminated");
for(int i=0; i<graph.size(); ++i) {
if(isAnEdge((String)(((GraphNode)graph.get(i)).getVertex()),(String)(node.getVertex()))) {
EdgeNode e1 = new EdgeNode((String)node.getVertex(),1);
EdgeNode e2 = new EdgeNode((String)((GraphNode)graph.get(i)).getVertex(),1);
node.addEdge(e2);
((GraphNode)graph.get(i)).addEdge(e1);
graph.add(node);
public boolean deleteNode(String word) {
GraphNode node = new GraphNode(word);
EdgeNode n = new EdgeNode(word,1);
if(!graph.contains(node)) {
return false;
else {
for(int i=0; i<graph.size();++i) {
((GraphNode)graph.get(i)).getEdgeList().remove(n);
graph.remove(node);
return true;
public void save(String fileName) {
try {
PrintWriter output = new PrintWriter(new FileWriter("word.txt"));
for(int i=0; i< graph.size();++i) {
output.println(((GraphNode)graph.get(i)).getVertex());
output.close();
catch (IOException e) {
// given two word, find the ladder (using dijkstra's algorithm
// create a string for the ladder and return it
public String findLadder(String start,String end) {
String ladder = new String();
GraphNode sv = new GraphNode(start);
GraphNode ev = new GraphNode(end);
if(!graph.contains(sv)) {
JOptionPane.showMessageDialog(null,start + " not in graph");
return null;
if(!graph.contains(ev)) {
JOptionPane.showMessageDialog(null,end + " not in graph");
return null;
LinkedList distance = new LinkedList(((GraphNode)graph.get(graph.indexOf(sv))).getEdgeList());
LinkedList visited = new LinkedList();
visited.add(start);
LinkedList path = new LinkedList();
path.add(new PathNode(start,"****"));
for(int i=0; i<distance.size();++i) {
PathNode p = new PathNode((String)((EdgeNode)distance.get(i)).getKey(),start);
path.add(p);
while(!visited.contains(end)) {
EdgeNode min = findSmallest(distance,visited);
String v = (String)min.getVertex();
if(v.equals("****"))
return null;
visited.add(v);
// for(int i=0;i<graph.size();++i) {
// String u = (String)(((GraphNode)(graph.get(i))).getVertex());
GraphNode temp1 = new GraphNode(v);
int index = graph.indexOf(temp1);
LinkedList l = new LinkedList(((GraphNode)graph.get(index)).getEdgeList());
for(int i=0;i<l.size();++i)
String u = (String)(((EdgeNode)(l.get(i))).getVertex());
if(!visited.contains(u)) {
int du=999, dv=999, avu=999;
dv = min.getCost();
EdgeNode edge = new EdgeNode(u,1);
if(distance.contains(edge)) {
du = ((EdgeNode)(distance.get(distance.indexOf(edge)))).getCost();
GraphNode temp = new GraphNode(v);
GraphNode node = ((GraphNode)(graph.get(graph.indexOf(temp))));
LinkedList edges = node.getEdgeList();
if(edges.contains(edge)) {
avu = ((EdgeNode)(edges.get(edges.indexOf(new EdgeNode(u,1))))).getCost();
if( du > dv+avu) {
if(du == 999) {
distance.add(new EdgeNode(u,dv+avu));
path.add(new PathNode(u,v));
else {
((EdgeNode)(distance.get(distance.indexOf(u)))).setCost(dv+avu);
((PathNode)(path.get(path.indexOf(u)))).setEnd(v);
if(!path.contains(new PathNode(end,"")))
return null;
LinkedList pathList = new LinkedList();
for(int i=0;i<path.size();++i) {
PathNode n = (PathNode)path.get(path.indexOf(new PathNode(end,"****")));
if(n.getEnd().compareTo("****") != 0) {
pathList.addFirst(end);
n = (PathNode)path.get(path.indexOf(new PathNode(n.getEnd(),"****")));
end = n.getStart();
pathList.addFirst(start);
for(int i=0;i<pathList.size()-1;++i) {
ladder = ladder + ((String)(pathList.get(i))) + " --> ";
ladder = ladder + ((String)(pathList.get(pathList.size()-1)));
return ladder;
private EdgeNode findSmallest(LinkedList distance, LinkedList visited) {
EdgeNode min = new EdgeNode("****",999);
for(int i=0;i<distance.size();++i) {
String node = (String)(((EdgeNode)distance.get(i)).getVertex());
if(!visited.contains(node)) {
if(((EdgeNode)distance.get(i)).getCost()<min.getCost()) {
min = (EdgeNode)distance.get(i);
return min;
// class that represents nodes inserted into path set
private class PathNode {
protected String sv;
protected String ev;
public PathNode(String s,String e) {
sv = s;
ev = e;
public String getEnd() {
return ev;
public String getStart() {
return sv;
public void setEnd(String n) {
ev = n;
public boolean equals(Object o) {
return this.sv.equals(((PathNode)o).sv);
public String toString() {
return "("+sv+":"+ev+")";
}thank you -
Please help improve the Career Center
Hello Everyone,
We need to hear from you on how to improve the Career Center going forward. Please visit [IdeaPlace |https://ideas.sap.com/community/community_and_services/scncareercenter;jsessionid=449247A26F00DD480CACAF4C4ABB0237.node0] and and post your suggestions and ideas for the Career Center. The ideas can be anything from how to make this forum more effective, what features to add to resumes and job postings, integration with other sites, new content needed, collaboration with University Alliances, etc. No idea is too big or too small. If you don't have any ideas, that's not a problem. Just take a minute to vote on the ideas already posted. [IdeaPlace|https://ideas.sap.com/community/community_and_services/scncareercenter;jsessionid=449247A26F00DD480CACAF4C4ABB0237.node0].
Many thanks!
ClaudineI got in easy on my end and actually just upgraded last week.
Only thing I can think of is its a server issue on Verizon's end. I know they have many servers that people are redirected to, but dont know how it all works.
Have you all tried using different broswers and still got the same message? If so its almost guaranteed its on their side.
Maybe you are looking for
-
Problems with wrt610n and mac mini (MA206LL/A*)
i purchased a new wrt610n and one of the machines that is connected is a mac mini, 1.66 ghz intel core duo. #ma2066/ll/a for those who want to compare notes. the computer is stock with the 802.11g wireless card that came with the machine. it is runn
-
Hi all, I have time characterstics Posting period (0fiscper3).........and i have hierarchy on this.......FY QUATERLY......... Now my requirement is in report i need two cloumns one with PRESENT QUARTER and one with PREVIOUS QUARTER...........how to a
-
Hi im trying to make an update to one of my applicatins and its not letting me do it because they say that there a problem with my security code on my card i been trying putting all my card info again and it wouldnt let me do it What can i do?
-
Hi, I have done the partner profile configuration.But still i m getting the error like this."Partner profile inbound not available" . How to resolve this problem? How to configure the Partner profile to resolve the problem? Thanks, Soumya.
-
Right after where it says my carrier, and before where it says the time, it usually has a 3G but for the past hour it has said E and at one point it went to a circle and my Internet is going really slow. What's happening?