All Paths between 2 Nodes

Hi ,
Can someone please let me know how I could be achieving this?
I want to find out all the paths between the Source Node A and the Destination Node B.
I donot want the shortest path but all the paths between the 2 nodes.
Also I donot have any weight/cost associated with any path. ( Graph is a directed graph)
Regards,
Akshatha

Hi,
Maybe this :Scott@my11g SQL>l
1 with links(n1,n2) as (
2 select 'A','B' from dual
3 union all select 'A','C' from dual
4 union all select 'B','C' from dual
5 union all select 'B','D' from dual
6 union all select 'D','G' from dual
7 union all select 'C','G' from dual
8 union all select 'D','I' from dual
9 union all select 'C','E' from dual
10 union all select 'E','F' from dual
11 union all select 'F','G' from dual
12 union all select 'F','H' from dual
13 )
14 select pth
15 from (
16 select connect_by_root(n1) || sys_connect_by_path(n2,'>') pth ,n2
17 from links
18 start with n1='A'
19 connect by nocycle prior n2=n1
20 )
21* where n2='G'
Scott@my11g SQL>/
PTH
A>B>C>E>F>G
A>B>C>G
A>B>D>G
A>C>E>F>G
A>C>G

Similar Messages

Network LOD support for All Paths between 2 nodes

In the in-memory Network API, there is a method NetworkManager.allPaths. This method returns available paths between 2 nodes with possible constraints. I am looking for a similar method in the LOD NetworkAnalyst class and am not finding it. Is there something similar?
Or, here is what I want to do, and maybe there is a better way to do it. I am using NDM to data-mine our roadway inventory. Its a big network, whole state of Ohio, all roads--both local and state. One of the things I am trying to identify are what we call co-located routes. These are routes that have multiple names, for example, the ohio turnpike is both Interstate 80 and 90 on the same bed of road. In our line work, where these routes are co-located, we would only have a record for 80. The portion of 90 that we would have would be only in the case where it is NOT co-located with 80; in other words, 90 has a gap where it is co-located with 80. This is true for all our roads. In this case, we call 80 the primary, and 90 the secondary. We can have infinite secondaries (our worst case scenario is 6 routes overlapping). My situation in many cases, is I know that a route becomes secondary, I know how long the secondary section is, but I don't know what the primary is, so I want to discover it.
Given these assumptions, I should be able to ask for all paths between 2 nodes that exactly match a cost (the overall length of the overlap). This should be simple with NDM. I provide a begin node, an end node, and a target cost, possible some traversal constraints, and it returns me the candidate paths. I thought that NetworkAnalyst.withinCost would do this, but as I discovered from the Stored Procedure docs, it returns the shortest path within the given less than or equal to the given cost--not necessarily the path I am looking for.
Any advice? FYI, I am using Oracle 11GR2.
Thanks, Tom

So what I have come up with so far, is that the NetworkAnalyst trace methods provide this type of functionality. For example, with traceOut, I provide a start node, distance and some traversal constraints, and it returns me all paths less than or equal to the specified distance. What was throwing me a little with this method was the application of the LODGoalNode. I was thinking that the goal node would allow me to specify a particular node to be a requirement for the entire path such that a resulting path would have my start node, and end on a particular goal node with links in between. That IS NOT how it works. The LODGoalNode.isGoal is tested for EACH link that is part of a potential path, and only if this method returns true, is it added to the resulting path list.
In my case, if I specified a start node and implemented the LODGoalNode.isGoal method such that it tested the provided end node for equality to my target node, the result would be that only links containing that specific goal node in the link. Anyway, so in my implementation, I leave the goalNode of the traceOut method null.
So I have a new question. Is there a way to test when a path has been found, and then apply some constraints on it (PathConstraint)? This would be useful in cases where you get many paths returned to you, but in addition to a maximum distance constraint, you also want to apply for example a minimum distance on the resulting path, or that this is only a valid path if it ends on a particular node. Maybe there is a way to do this, and I haven't figured it out yet. The old AnalysisInfo class used to have a way to query the current path links and nodes, that would be useful in the LODAnalysisInfo class to help accomplish this perhaps? This feature isn't critical, because I can filter the list of paths returned from traceOut on my own after they are returned, but it would add some efficiency, especially when a large amount of paths are returned.
Thanks, Tom

Finding Paths Between Two Nodes Using SQL Sorted by Cost

Hi Gurus,
I want to find all paths from source node to target node that shall be sorted by the cost. I don't know whether it could be achieved with SQL statement. How to start with this query? The script to create the underlying tables along with the data are given below:
create table nodes ( nodeId int Primary Key, nodeName varchar(50));
create table paths ( pathId int Primary Key, fromNodeId int, toNodeId int, cost int );
insert into nodes values (1,'ISL');
insert into nodes values (2,'LHR');
insert into nodes values (3,'HYD');
insert into nodes values (4,'FSL');
insert into nodes values (5,'MUL');
insert into nodes values (6,'KHI');
insert into nodes values (7,'QT');
insert into paths values (1,1,3,20);
insert into paths values (2,1,5,10);
insert into paths values (3,1,7,80);
insert into paths values (4,2,4,10);
insert into paths values (5,3,4,40);
insert into paths values (6,3,5,20);
insert into paths values (7,3,6,10);
insert into paths values (8,6,7,30);
insert into paths values (9,6,5,30);
insert into paths values (10,6,3,10);
insert into paths values (11,7,2,20);
insert into paths values (12,5,4,40);
insert into paths values (13,5,7,40);
Suppose the source = ISL and target = QT, their are various paths from ISL to QT:
Ord# Relative Path Cost
==== ================================= =================
1. ISL -> MUL -> QT 50
2. ISL -> HYD -> KHI -> QT 60
3. ISL -> QT 80
4. ISL -> HYD -> MUL -> QT 80
5. ISL -> HYD to KHI -> MUL -> QT 100
This gives us all possible paths sorted by cost.
Any hint or help will be highly appreciated.
Thanks in advance and best regards
Bilal
Edited by: naive2Oracle on Feb 11, 2011 9:59 AM

I like recursive with clause B-)
col path for a30
with nodes(nodeId,nodeName) as(
select 1,'ISL' from dual union
select 2,'LHR' from dual union
select 3,'HYD' from dual union
select 4,'FSL' from dual union
select 5,'MUL' from dual union
select 6,'KHI' from dual union
select 7,'QT' from dual),
paths(fromNodeId,toNodeId,cost) as(
select 1,3,20 from dual union
select 1,5,10 from dual union
select 1,7,80 from dual union
select 2,4,10 from dual union
select 3,4,40 from dual union
select 3,5,20 from dual union
select 3,6,10 from dual union
select 6,7,30 from dual union
select 6,5,30 from dual union
select 6,3,10 from dual union
select 7,2,20 from dual union
select 5,4,40 from dual union
select 5,7,40 from dual),
tmp(nodeName,fromNodeId,toNodeId,cost) as(
select a.nodeName,b.fromNodeId,b.toNodeId,b.cost
from nodes a,paths b
where a.nodeId=b.fromNodeId),
rec(nodeName,path,fromNodeId,toNodeId,cost) as(
select nodeName,cast(nodeName as varchar2(40)),
fromNodeId,toNodeId,cost
from tmp
where nodeName = 'ISL'
union all
select b.nodeName,a.path || '->' || b.nodeName,
b.fromNodeId,b.toNodeId,
a.cost+decode(b.nodeName,'QT',0,b.cost)
from rec a,tmp b
where a.toNodeId = b.fromNodeId
   and a.nodeName !='QT')
CYCLE fromNodeId SET IsLoop TO 'Y' DEFAULT 'N'
select path,cost from rec
where IsLoop ='N'
and nodeName ='QT'
order by cost;
PATH                    COST
ISL->MUL->QT              50
ISL->HYD->KHI->QT         60
ISL->HYD->MUL->QT         80
ISL->QT                   80
ISL->HYD->KHI->MUL->QT   100

Shortest path between two arbitrary point in the network

Hi All,
In oracle NDM, it's possible to find shortest path between two nodes (e.g. using SDO_NET_MEM.NETWORK_MANAGER.SHORTEST_PATH), but I need to find shortest path between 2 points which are on the network edges. I suppose I should use (Interface SubPath) in network java apis. However I want to do it via PLSQL api. Should I code it myself or there exists a function?
Any help is appreciated.
Edited by: Fa on Dec 15, 2011 2:51 AM

pritamg wrote:
I have to build an application in which the user will draw the graph by creating nodes and edges.and then the start node will be marked.Then the shortest paths to other nodes will be displayed.Give me any possible clue how to start.I am in deep deep trouble.I have to use Dijkstra's Algorithm.
please help some one...pleaseDo you know Dijkstra's Algorithm for shortest path? I believe that one was also called the traveling salesman problem. You can easily Google to find out what it is.
Did you listen to your instructor when he/she did his/her lectures on recursion and halting contitions? If not, then please go talk to him/her and read your book, the forum is not a place to try to learn a basic concept that you should have paid attention in class for the first time.
If you have code and you have specific questions post them and we will be glad to help, but we are not here to develop your homework solutions for you, no matter how that may affect your future.

X-path query to get all versions of a node at a given path in JSP

hi need a xpath query so that i can list all the versions of a selected node which can be used for restoring the version to that particular one??

I'm not sure about an xpath query (which was deprecated in JCR 2.0), but here's how you could use the JCR API to retrieve all of the versions from a path:
     * Returns all of the versions at the specified path as a List of Versions.
     * @param session
     *            the currect JCR session, must not be null
     * @param path
     *            the absolute path of the node to retrieve
     * @return the list of versions at the specified path
     * @throws UnsupportedRepositoryOperationException
     *             thrown if the node at the specified path is not versionable
     * @throws RepositoryException
     *             an unexpected exception occurs interacting with the JCR
     *             repository
    public List<javax.jcr.version.Version> getVersions(final Session session,
        final String path) throws UnsupportedRepositoryOperationException,
        RepositoryException {
    final List<Version> versions = new ArrayList<Version>();
    final VersionManager versionMgr = session.getWorkspace()
        .getVersionManager();
    final VersionHistory versionHistory = versionMgr
        .getVersionHistory(path);
    final VersionIterator versionIterator = versionHistory.getAllVersions();
    while (versionIterator.hasNext()) {
        versions.add(versionIterator.nextVersion());
    return versions;

Graph Theory Algorithm-All possible paths between 2 vertices w/ constraints

Hi all,
I have a project I'm working with. I need to find all possible paths between two vertices on a graph.
I realize this will be NP-complete or worse, but right now i'm looking for a brute force method to do this via algorithm/pseudocode
Given:
connected, weighted edges, directed Graph G = (V,E) with no loops
Given v1 and v2 are vertices in V, and C = constraint value,
I would like a way to find all possible paths from v1 to v2 that have a length less than C. Length = adding up all the edges on a path
Can anyone provide any help on this?
Thanks!

Sure, no problemo.
Create a bucket of paths, initially empty. (Bucket is a technical term for a collection)
Start at v1. Take all the edges that lead from v1 to any place else, like x.
Each one of those paths consists of a single edge is a path from v1 to somewhere and furthermore it has a length. It is a partial path with a length Now do it again, grab any path out of the bucket, leave from its terminal point x and extend it by an edge and create a bunch more paths that are now two edges long, which you can throw back into that same bucket.
If you ever get to v2, you have a path from v1 to p2. Add it to your solutions list. If you ever exceed C, well throw it out because it is too long. And if you can't extend from a particular vertex then toss it as well.
All you ever do is pull a partial path from the bucket, create all its possible one edge extensions, keep the winners, toss out the impossible, and throw all new still valid partial paths back into the bucket.
If there are loops and if there are edges with zero or negative weight, this would not necessarily terminate. But you say that is not a problem for you.
Just for the record, nothing is worse than NP-complete.

SSMS 2012:FOR XML PATH Using XPath Node Tests-Columnn name 'test()' contains an invalid XML identifier as required by FOR XML?

Hi all,
I am learning XPATH and XQUERY from the Book "Pro T-SQL 2008 Programmer's Guide" written by Michael Coles, (published by apress). I copied the Code Listing 12-8 FOR XML PATH Using XPath Node Tests (listed below) and executed it in my
SQL Server 2012 Management Studio:
--Coles12_8.sql // saved in C:/Documemnts/SQL Server Management Studio
-- Coles Listing 12-8 FOR XML PATH Using XPATH Node Tests
-- Retrieving Name and E-mail Addresses with FOR XML PATH in AdvantureWorks
-- 16 March 2015 0935 AM
USE AdventureWorks;
GO
SELECT
p.NameStyle AS "processing-instruction(nameStyle)",
p.BusinessEntityID AS "Person/@ID",
p.ModifiedDate AS "comment()",
pp.PhoneNumber AS "test()",
FirstName AS "Person/Name/First",
MiddleName AS "Person/Name/Middle",
LastName AS "Person/Name/Last",
EmailAddress AS "Person/Email"
FROM Person.Person p
INNER JOIN Person.EmailAddress e
ON p.BusinessEntityID = e.BusinessEntityID
INNER JOIN Person.PersonPhone pp
ON p.BusinessEntityID = pp.BusinessEntityID
FOR XML PATH;
I got the following error message:
Msg 6850, Level 16, State 1, Line 2
Column name 'test()' contains an invalid XML identifier as required by FOR XML; '('(0x0028) is the first character at fault.
I have no ideas why I got this error message. Please kindly help and advise me how to resolve this error.
Thanks in advance, Scott Chang

Hi Michelle, Thanks for your nice response.
I corrected the mistake and executed the revised code. It worked nicely.
I just have one question to ask you about the appearance of the xml output of my Co;les12_8.sql:
<row>
<?nameStyle 0?>
<Person ID="1" />
697-555-0142<Person><Name><First>Ken</First><Middle>J</Middle><Last>Sánchez</Last></Name><Email>[email protected]</Email></Person></row>
<row>
<?nameStyle 0?>
<Person ID="2" />
819-555-0175<Person><Name><First>Terri</First><Middle>Lee</Middle><Last>Duffy</Last></Name><Email>[email protected]</Email></Person></row>
<row>
<?nameStyle 0?>
<Person ID="3" />
212-555-0187<Person><Name><First>Roberto</First><Last>Tamburello</Last></Name><Email>[email protected]</Email></Person></row>
<row>
<?nameStyle 0?>
<Person ID="4" />
612-555-0100<Person><Name><First>Rob</First><Last>Walters</Last></Name><Email>[email protected]</Email></Person></row>
<row>
<?nameStyle 0?>
<Person ID="5" />
849-555-0139<Person><Name><First>Gail</First><Middle>A</Middle><Last>Erickson</Last></Name><Email>[email protected]</Email></Person></row>
<row>
<?nameStyle 0?>
<Person ID="6" />
122-555-0189<Person><Name><First>Jossef</First><Middle>H</Middle><Last>Goldberg</Last></Name><Email>[email protected]</Email></Person></row>
<row>
<?nameStyle 0?>
<Person ID="7" />
181-555-0156<Person><Name><First>Dylan</First><Middle>A</Middle><Last>Miller</Last></Name><Email>[email protected]</Email></Person></row>
<row>
<?nameStyle 0?>
<Person ID="8" />
815-555-0138<Person><Name><First>Diane</First><Middle>L</Middle><Last>Margheim</Last></Name><Email>[email protected]</Email></Person></row>
<row>
<?nameStyle 0?>
<Person ID="9" />
185-555-0186<Person><Name><First>Gigi</First><Middle>N</Middle><Last>Matthew</Last></Name><Email>[email protected]</Email></Person></row>
<row>
<?nameStyle 0?>
<Person ID="10" />
330-555-2568<Person><Name><First>Michael</First><Last>Raheem</Last></Name><Email>[email protected]</Email></Person></row>
<row>
<?nameStyle 0?>
<Person ID="11" />
719-555-0181<Person><Name><First>Ovidiu</First><Middle>V</Middle><Last>Cracium</Last></Name><Email>[email protected]</Email></Person></row>
<row>
I feel this xml output is not like the regular xml output. Do you know why it is diffrent from the regular xml xml output? Please comment on this matter.
Thanks,
Scott Chang
What do you mean by regular xml document? Are you referring to fact that its missing a root element? if yes it can be added as below
USE AdventureWorks;
GO
SELECT
p.NameStyle AS "processing-instruction(nameStyle)",
p.BusinessEntityID AS "Person/@ID",
p.ModifiedDate AS "comment()",
pp.PhoneNumber AS "text()",
FirstName AS "Person/Name/First",
MiddleName AS "Person/Name/Middle",
LastName AS "Person/Name/Last",
EmailAddress AS "Person/Email"
FROM Person.Person p
INNER JOIN Person.EmailAddress e
ON p.BusinessEntityID = e.BusinessEntityID
INNER JOIN Person.PersonPhone pp
ON p.BusinessEntityID = pp.BusinessEntityID
FOR XML PATH('ElementName'),ROOT('RootName');
replace ElementName and RootName with whatever name you need to set for element as well as the root element
Please Mark This As Answer if it solved your issue
Please Vote This As Helpful if it helps to solve your issue
Visakh
My Wiki User Page
My MSDN Page
My Personal Blog
My Facebook Page

Replication between 130 nodes and 1 Data Center

Hi everyone.
I have 130 database nodes (Oracle Standard Edition One) with a big distance of separation, and 1 Data Center with 3 nodes (Oracle Real Application Cluster 10g R2). The connection between nodes and datacenter is through various ISP ( WAN).
I have exactly the same model design of database in nodes and datacenter.
DataCenter is a repository of data for reporting to directors and dictate the business rules to guide all nodes.
Each node have approximately 15 machines connected with desktop application.
In other words Desktop Application with a Backend Database (node).
My idea of replication is not instantly, when a transaction commit in a node then replicate to datacenter. Also over nigth replicate images because is heavy, approximately 1 mg per image. Each image correspond to one transaction.
On the orher hand i have to replicate some data from datacenter to nodes, business rule, for example: new company names, new persons, new prohibitions, etc.
My problem is to determine th best way to replicate data through nodes to datacenter.
Please somebody could suggest me the best solution.
Thanks in advanced.

Last I checked, Streams and multi-master replication require enterprise edition databases at both ends, which rules them out for the sort of deployment you're envisioning.
If a given table will only ever be modified on nodes or on the master site, never both, you can build everything as read-only materialized views. This would probably require, though, that the server at the data center have 130 copies of each table, 1 per node. For schemas of any size, this obviously gets complicated very quickly. For asynchronous replcation to work, you'd need to schedule periodic refreshes, which assumes that you have relatively stable internet connections between the nodes and the data center.
I guess I would tend to question the utility of having so many nodes. Is it really necessary to have so many? Or could you just beef up the master and have everyone connect directly?
Justin
Distributed Database Consulting, Inc.
http://www.ddbcinc.com/askDDBC

How can I find the all path available for a MPLS VPN in SP network

How can I find the all path available for a MPLS VPN in SP network between PE to PE and CE to CE?

Hi There
If we need to find all the available paths for a remote CE from a local PE it will depend upon whether its a RR or non-RR design. If the MP-iBGP deisgn is non-RR the below vrf specific command
sh ip bgp vpnv4 vrf "vrf_name" will show us the MP-iBGP RT for that particular VPN. It will show us the next hop. Checking the route for same in the Global RT will show us the path(s) available for same ( load-balancing considered) .Then we can do a trace using the Local PE MP-iBGP loopback as source to remote PE's MP-iBGP loopback to get the physical Hops involved.
However if the design is RR-based there might be complications involved when the RR is in the forwarding path ie we have NHS being set to RR-MP-iBGP loopback and the trace using the Local PE MP-iBGP loopback as source to remote PE's MP-iBGP loopback will get us the physical Hops involved.
If we have redundant RRs being used with NHS being set then the output of sh ip bgp vpnv4 vrf "vrf_name" will show us two different available paths for the remote CE destination but just one being used.
RR-based design with no NHS being used will always to cater to single path for the remote CE detsination.
So in any case the actual path used for the remote CE connectivity would be a single unless we are using load-balancing.
Hope this helps you a bit on your requirement
Thanks & Regards
Vaibhava Varma

How to delete a path between two anchor points

hi ,
it's all in the title ,
could you tell me please how to delete a path between two anchor points without using the path eraser tool ?
When I select these two anchor points and press delete everything is gone.
ps : I want to keep the anchor points after the deletion
Thank you

Silkrooster wrote:
With some experimentation, I did find that selecting the path can leave orphan points. So keep that in mind as it may be necessary to use Object>Path>Clean up...
You will not get orphan points if you delete a segment that is not at the end of a path. For segment that is at the end of a path, or is the entire path, select the end point/s and press delete. For the one segment that is entire path you can use the selection tool (black pointer) or hold Alt with the direct selection tool (white pointer) which is useful for objects in a group.

Export / Reports for STS utilization on Span's between 15454 nodes

So...
I'm looking for a convenient way to keep track of my STS allocation by running reports for our customer circuits, between our various SONET 15454 and 15310 nodes. Ideally, I'd like to be able to tell CTC or CTM to generate a report which shows me how much (and which ones) STS-1's I'm using between various nodes, in a nice concise format; to help me plan for capacity, circuit rolls, and expansion. The report should also include things like % of a particular OC-48 or or OC-192 is used, available, outline of contiguous and non-contiguous STS's, and summary for all my point-to-point circuits utilization.
Currently what I have to do is:
1) Export from circuit-view (in CSV format) for each span, a seperate exported
file or each span, one by one (hoping not to overlook one)
2) Reconcile each Exported file against a spreadsheet that I maintain/update
(about once a week) updating the stats for each span
This way, I "hopefully" have a living document, updated with what bandwidth I have where (and for who), which I can reference in a consolidated way for my entire 15454 network. This greatly simplify's my capacity planing, rolls, and generally just keeping tabs on what and who I have assigned where.
It seem like there should be a simple "Generate Report" feature either whithin CTC or CTM. I should be able to customize it as I want.
Perhaps there is 3rd party software to inject into CTM which will extract such a report.
For all you 15454 guys and gals out there, please help if you know of a solution!!
--Scott

So...
I'm looking for a convenient way to keep track of my STS allocation by running reports for our customer circuits, between our various SONET 15454 and 15310 nodes. Ideally, I'd like to be able to tell CTC or CTM to generate a report which shows me how much (and which ones) STS-1's I'm using between various nodes, in a nice concise format; to help me plan for capacity, circuit rolls, and expansion. The report should also include things like % of a particular OC-48 or or OC-192 is used, available, outline of contiguous and non-contiguous STS's, and summary for all my point-to-point circuits utilization.
Currently what I have to do is:
1) Export from circuit-view (in CSV format) for each span, a seperate exported
file or each span, one by one (hoping not to overlook one)
2) Reconcile each Exported file against a spreadsheet that I maintain/update
(about once a week) updating the stats for each span
This way, I "hopefully" have a living document, updated with what bandwidth I have where (and for who), which I can reference in a consolidated way for my entire 15454 network. This greatly simplify's my capacity planing, rolls, and generally just keeping tabs on what and who I have assigned where.
It seem like there should be a simple "Generate Report" feature either whithin CTC or CTM. I should be able to customize it as I want.
Perhaps there is 3rd party software to inject into CTM which will extract such a report.
For all you 15454 guys and gals out there, please help if you know of a solution!!
--Scott

Path between Imovie HD and IDVD

When I press the "create IDVD project" in IMOVIE HD and expect my movie to be exported to IDVD I get nothing.
Can any one tell me how to see if the path between the two programs is gone? I am using MAC Leopard 10.5.8,
Imovie 5.0.2, IDVD 7.0.4. I have used IDVD in the past but this movie is too large and I needed to break it up.
I also, saved the file in the movies folder and then used the drag and drop into IDVD but what to with it, way too large for disc.
I still need to know why I cannot use the documented procedure. Any ideas?

Hi Jeep,
welcome to the  board
iMovie is a video edit app, meant to work with firewire connected miniDV camcorders.
iDVD is an encoding, authoring and burning app to create videoDVD
both apps are part of the iLife suite (plus iTunes, for music, iPhoto for photo, iWeb for website creation…), and are meant to work all together with a single click…
all apps can do other tricks (e.g. importing content of non-copy protected videoDVDs, editing mpegs etc), but as said, they are not meant for/other apps are better to accomplish that.
"ripping" DVDs is in my understanding to copy content from protected/commercial videoDVDs… that IS possible with a Mac, a few apps are on the market, the Rules of Common Behavior in this forum don't "allow" linking to such apps, because in most areas on this planet ownership, usage, even mentioning (! here in Germany…) such apps is illegal.
ripping is NOT supported by iDVD
to copy DVD can be done with every Mac included Disk Utility, to copy just parts you need 3rd party software. (a videoDVD is not meant for editing, it uses a delivery format… socalled "mpeg editing" is better supported on Windows… doesn't fullfill the high quality standards of Apple… )

Difference between value node,model node and recursion node?.

Hi all,
this is to ask you the difference between modal node, value node and recurrsion node?
please explain
Anhitya Kashyap

hi Anhit,
node can be classified as a value node or model node. The difference between value nodes and model nodes is that a value node can store the data itself, whereas the model node only references an external model object that stores the data.
more on nodes check this
http://help.sap.com/saphelp_webas630/helpdata/en/b8/cd96edb9c8794aa362e6e8b4236a1f/frameset.htm
thanks,
Saloni

Difference between Interface node and normal node?

What is the main difference between Interface node and normal node?
Cheers
Aisurya.

Hi surya,
Interface node or methods comes into picture whenever you want to use one component as used component. I mean to say
Component usages. If you select node as interface node, it will available in another component so you can use that node or methods.
Normal node means in that component only. Simply we can say for component usages we go for interface nodes.
Cehck This...
http://help.sap.com/saphelp_nw70ehp1/helpdata/EN/79/555e3f71e41e26e10000000a114084/content.htm
Cheers,
Kris.

Hi All difference between abap and hr-abap urgent pls

Hi All difference between abap and hr-abap urgent pls

Hello,
To add to the above points regarding infotypes
Infotypes stand apart in HR and manage a volume of data in HR domain..they are unique to HR module ranging from basic employee information to time management and finally the custom infotypes.....
Payroll and other monetory activities related to an employee also form a vital part of the HR module....
while considering Reports..in HR data is mainly with respect to infotypes and the concept of PAKEY...7 key fields which uniquely defines any record in an infotype is used..with Pernr(employee number),Begda(begindate) and Endda(enddate) form an integral part of the key..Based on the time constraints(1,2,3) of an infotype the keys are judged (to retrieve data from an infotype)
In ABAP HR we also have lots of predefined function modules that can be used..eg:go to se37..put 'HR*' and press F4...
finally to update an HR infotype record we use the function module hr operation rather than direct updates...also there are standard audit trail reports that monitors various activities such as insert/modify/delete operations on an hr infotype record...
Pls revert back for clarity and reward if helpful
Regards
Byju

All Paths between 2 Nodes

Similar Messages

Maybe you are looking for